Helpmate tablebases Every solution to every position, precomputed.

← all materials

KQPvkr

5 pieces.

h#9
longest mate: h#7
deepest unique: 105
positions at that depth: h#7
deepest dual: h#4.5
deepest strict dual: 444,286,406
positions with a helpmate: 27,358,057
with a unique solution: 355,074,048
cells in the plane: 308,014,292 bytes
on disk

Deepest unique problems

h#7

4k3/4Q3/8/8/3r4/8/3P4/K7 b - - 0 1

Kxe7 d3 Rb4 d4 Kd6 d5 Kc5 d6 Rb3 d7 Kb4 d8=Q Ka3 Qa5#

promotion excelsior excelsior:white self-block single-piece single-piece:white phoenix nocheck umnov

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

h#7

5k2/5Q2/8/8/6r1/8/6P1/K7 b - - 0 1

Kxf7 g3 Rb4 g4 Ke6 g5 Kd5 g6 Kc4 g7 Kb3 g8=Q+ Ka3 Qa2#

promotion excelsior excelsior:white self-block single-piece single-piece:white phoenix umnov

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

h#7

kQ6/8/8/8/r7/P7/8/1K6 b - - 0 1

Kxb8 Kc2 Rb4 axb4 Kc7 b5 Kd6 b6 Kc5 b7 Kb4 b8=Q+ Ka3 Qb3#

promotion phoenix

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#4.5. The deepest dual overall is h#7, where the two solutions share a first or a last move.

h#4.5

8/8/2r5/8/7k/8/1P4Q1/K7 w - - 0 1

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

Qh3+ Kg5 b4 Kf6 b5 Ke7 bxc6 Kd8 Qd7#
Qxc6 Kg3 Kb1 Kf2 Kc2 Ke1 Kd3 Kd1 Qh1#

pure model mirror single-piece single-piece:black

h#4.5

8/8/8/8/7k/1rQ5/1P6/K7 w - - 0 1

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

Kb1 Rxb2+ Qxb2 Kg3 Kc2 Kf2 Kd3+ Ke1 Qe2#
Qc4+ Kg3 Ka2 Kf2 Kxb3 Ke1 Kc3 Kd1 Qf1#

pure model mirror single-piece single-piece:black

h#4.5

6Q1/8/8/8/7k/Pr6/8/K7 w - - 0 1

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

Qc4+ Kg3 Ka2 Kf2 Kxb3 Ke1 Kc3 Kd1 Qf1#
Qxb3 Kg4 Qa2 Kf3 Kb2 Ke2 Kc3+ Kd1 Qd2#

pure model mirror single-piece single-piece:black