Helpmate tablebases Every solution to every position, precomputed.

← all materials

KNNNvk

5 pieces.

h#8
longest mate
h#6
deepest unique
4
positions at that depth
h#6
deepest dual
h#5
deepest strict dual
30,239,918
positions with a helpmate
753,275
with a unique solution
121,110,528
cells in the plane
28,184,883 bytes
on disk

Deepest unique problems

Only one distinct idea exists at this depth: 4 positions share a solution.

Deepest dual problems

Deepest dual with different first and last moves: h#5. The deepest dual overall is h#6, where the two solutions share a first or a last move.

h#5

8/7N/8/8/8/8/k7/2NK3N b - - 0 1

Two solutions, with different first and last moves (2 starts, 2 ends).

  1. Kb2 Nb3 Kc3 Kc1 Kd3 Nc5+ Ke2 Ng3+ Ke1 Nd3#
  2. Ka3 Kc2 Kb4 Kb1 Kc3 Ng5 Kd2 Nf3+ Kd1 Nf2#

pure model ideal mirror single-piece single-piece:black nocapture

Note: the side to move is in check in the diagram.