Helpmate tablebases Every solution to every position, precomputed.

← all materials

KPPvkq

5 pieces.

h#8.5
longest mate: h#7.5
deepest unique: 1
positions at that depth: h#7.5
deepest dual: h#6.5
deepest strict dual: 185,052,919
positions with a helpmate: 3,801,046
with a unique solution: 266,305,536
cells in the plane: 124,499,816 bytes
on disk

Deepest unique problems

Only one position exists at this depth.

h#7.5

8/7k/8/8/8/6P1/q5P1/K7 w - - 0 1

Kxa2 Kg6 Ka3 Kf5 g4+ Ke4 g5 Kd3 g6 Kc2 g7 Kb1 g8=Q Ka1 Qa2#

promotion 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#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/7k/8/1q6/8/3P4/1K5P/8 w - - 0 1

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

Kc1 Kg6 h4 Qg5+ hxg5 Kf5 g6 Ke5 g7 Kd4 g8=Q Kc3 Qc4#
Ka3 Kg6 d4 Kf5 d5 Ke4 d6 Kd3 d7 Kc2 d8=Q Kb1 Qd1#

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

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

h#6.5

8/8/2K5/8/3q4/3P1k2/3P4/8 w - - 0 1

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

Kb7 Qe5 d4 Ke4 dxe5 Kd5 e6 Kd6 e7 Kd7 Kb6 Kc8 e8=Q#
Kc7 Qe4 dxe4 Ke2 e5 Kd3 e6 Kc4 e7 Kb5 e8=Q+ Ka6 Qa4#

set-play pure model mirror promotion umnov

h#6.5

8/3K4/3q4/8/8/6P1/4P1k1/8 w - - 0 1

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

Kc8 Kf2 e4 Ke3 e5 Kd4 exd6 Kc5 d7 Kb6 d8=Q+ Ka7 Qa5#
Ke8 Kh3 g4 Kh4 g5 Kh5 g6 Kh6 g7 Kh7 Kf7 Qh6 g8=Q#

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

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