Helpmate tablebases Every solution to every position, precomputed.

← all materials

KRPvkq

5 pieces.

h#9
longest mate: h#7
deepest unique: 7
positions at that depth: h#7.5
deepest dual: h#5.5
deepest strict dual: 443,253,384
positions with a helpmate: 17,921,509
with a unique solution: 355,074,048
cells in the plane: 258,003,528 bytes
on disk

Deepest unique problems

h#7

6Rk/7q/8/8/8/8/1P6/2K5 b - - 0 1

Kxg8 b3 Kf7 b4 Ke6 b5 Kd5 b6 Kc4 b7 Kb3 b8=Q+ Ka2 Qb2#

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

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

h#7

6Rk/7q/8/8/8/8/4P3/2K5 b - - 0 1

Kxg8 e3 Kf7 e4 Ke6 e5 Kd5 e6 Kc4 e7 Kb3 e8=Q Ka2 Qa4#

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

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

h#7

8/8/8/K7/8/8/3P3R/6qk b - - 0 1

Kxh2 d4 Kg3 d5 Kf4 d6 Ke5 d7 Kd6 Kb5 Kc7 Ka6 Kb8 d8=Q#

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

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#7.5, where the two solutions share a first or a last move.

Only 2 distinct ideas exist at this depth.

h#5.5

K7/4q3/8/8/8/2P3R1/5k2/8 w - - 0 1

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

Rg1 Ke3 c4 Kd4 Kb8 Kc5 Kc8 Kb6 c5+ Ka7 Ra1#
Rg2+ Ke3 c4 Kd4 Kb8 Kc5 Kc8 Kb6 c5+ Ka7 Ra2#

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

h#5.5

K7/4q3/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