Helpmate tablebases Every solution to every position, precomputed.

← all materials

KQNPvk

5 pieces.

h#9
longest mate: h#7
deepest unique: 160
positions at that depth: h#7
deepest dual: h#3.5
deepest strict dual: 489,029,489
positions with a helpmate: 57,641,214
with a unique solution: 355,074,048
cells in the plane: 371,327,358 bytes
on disk

Deepest unique problems

h#7

8/8/8/8/8/6N1/Q5P1/k2K4 b - - 0 1

Kxa2 Ne2 Kb3 g4 Kc4 g5 Kd3 g6 Ke3 g7 Kf2 g8=Q Kf1 Qg1#

promotion excelsior excelsior:white single-piece single-piece:black phoenix nocheck

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

h#7

8/8/8/8/8/N7/P5Q1/3K1k2 b - - 0 1

Kxg2 Nc2 Kf3 a4 Ke4 a5 Kd3 a6 Kc3 a7 Kb2 a8=Q Kb1 Qa1#

promotion excelsior excelsior:white single-piece single-piece:black phoenix nocheck

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

h#7

8/8/8/8/8/5N2/K4PQ1/6k1 b - - 0 1

Kxg2 Nd4 Kf1 f4 Ke1 f5 Kd2 f6 Kc3 f7 Kb4 f8=Q+ Ka4 Qa3#

promotion excelsior excelsior:white single-piece single-piece:black phoenix

Note: the diagram has no legal last move, so it cannot arise in a game.

Deepest dual problems

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

h#3.5

k7/8/8/8/8/1P2Q3/8/K6N w - - 0 1

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

Kb2 Kb7 Kc3 Ka6 Kc4 Ka5 Qa7#
Nf2 Kb7 Nd3 Ka6 Nb4+ Ka5 Qc5#

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

h#3.5

7k/8/8/8/8/3Q2P1/8/N1K5 w - - 0 1

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

Kd2 Kg7 Ke3 Kh6 Kf4 Kh5 Qh7#
Nc2 Kg7 Ne3 Kh6 Ng4+ Kh5 Qf5#

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

h#3.5

8/7k/1Q6/8/8/8/2P5/N2K4 w - - 0 1

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

Qg1 Kh6 Ke2 Kh5 Kf3 Kh4 Qg4#
Qe3 Kg6 Ke2 Kh5 Kf3 Kh4 Qh6#

pure mirror single-piece single-piece:black nocapture nocheck