Helpmate tablebases Every solution to every position, precomputed.

← all materials

KNPvkr

5 pieces.

h#9
longest mate
h#7.5
deepest unique
3
positions at that depth
h#7.5
deepest dual
h#6.5
deepest strict dual
519,332,009
positions with a helpmate
11,814,755
with a unique solution
355,074,048
cells in the plane
299,024,800 bytes
on disk

Deepest unique problems

Only 2 distinct ideas exist at this depth.

Deepest dual problems

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

h#6.5

8/8/8/8/8/1P6/1N6/2Kr2k1 w - - 0 1

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

  1. Kc2 Kf2 b4 Ke3 b5 Kd4 b6 Kc5 b7 Kb4 b8=Q+ Ka3 Qb3#
  2. Nxd1 Kf1 b4 Ke2 b5 Kd3 b6 Kc4 b7 Kb3 b8=Q+ Ka2 Qb2#

promotion closed-walk single-piece single-piece:black

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