Helpmate tablebases Every solution to every position, precomputed.

← all materials

KRPvkr

5 pieces.

h#8.5
longest mate: h#7
deepest unique: 2
positions at that depth: h#6
deepest dual: h#5.5
deepest strict dual: 483,238,420
positions with a helpmate: 23,010,958
with a unique solution: 355,074,048
cells in the plane: 229,056,335 bytes
on disk

Deepest unique problems

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

h#7

8/8/8/8/K7/8/kR2P3/r7 b - - 0 1

Kxb2+ Kb5 Kc3 e4 Kd4 e5 Kd5 e6 Kd6 e7 Kd7 Kb6 Kc8 e8=Q#

pure model mirror promotion excelsior excelsior:white single-piece single-piece:black

Note: the side to move is in check in the diagram; the solution begins with a capture.

Deepest dual problems

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

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

h#5.5

K7/3r4/8/8/8/2P4R/5k2/8 w - - 0 1

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

Rh1 Ke3 c4 Kd4 Kb8 Kc5 Kc8 Kb6 c5+ Ka7 Ra1#
Rh2+ Ke3 c4 Kd4 Kb8 Kc5 Kc8 Kb6 c5+ Ka7 Ra2#

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