Helpmate tablebases Every solution to every position, precomputed.

← all materials

KPvknn

5 pieces.

h#9.5
longest mate: h#7.5
deepest unique: 476
positions at that depth: h#8
deepest dual: h#7
deepest strict dual: 278,943,708
positions with a helpmate: 2,566,266
with a unique solution: 355,074,048
cells in the plane: 113,706,332 bytes
on disk

Deepest unique problems

h#7.5

8/8/8/8/5k2/8/3n1P2/K2n4 w - - 0 1

Ka2 Ke4 f4 Nf3 Ka3 Ng5 fxg5 Kd3 g6 Kc2 g7 Kb1 g8=Q Ka1 Qa2#

promotion excelsior excelsior:white nocheck umnov

h#7.5

5k2/8/8/8/1n6/1n6/1P6/K7 w - - 0 1

Kb1 Na6 Kc2 Na5 b4 Ke7 b5 Kd6 bxa6 Kc5 a7 Kb4 a8=Q Ka3 Qxa5#

pure model ideal mirror promotion excelsior excelsior:white nocheck

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

h#7.5

6k1/8/8/8/3n4/8/3P4/1K1n4 w - - 0 1

Kc1 Ne3 dxe3 Kf7 e4 Ke6 e5 Kd5 e6 Kc4 e7 Kb3 e8=Q Ka2 Qa4#

pure model mirror promotion excelsior excelsior:white nocheck umnov

Deepest dual problems

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

h#7

6k1/8/8/3n4/1n6/8/3P4/2K5 b - - 0 1

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

Nc3 dxc3 Kf7 cxb4 Ke6 b5 Kd5 b6 Kc4 b7 Kb3 b8=Q+ Ka2 Qb2#
Ne3 dxe3 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 umnov

h#7

3n4/2K5/8/8/8/3P2n1/7k/8 b - - 0 1

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

Kh3 d4 Kg4 d5 Ne6+ dxe6 Kf5 e7 Ke6 Kb7 Kd7 Kb6 Kc8 e8=Q#
Ne4 dxe4 Kg3 e5 Kf4 e6 Ke5 Kb6 Kd6 Ka6 Kc7 e7 Kb8 exd8=Q#

pure model ideal mirror promotion umnov

h#7

1n4k1/8/8/3n4/8/8/3P4/2K5 b - - 0 1

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

Nc3 dxc3 Kf7 c4 Ke6 c5 Kd5 c6 Kc4 c7 Kb3 cxb8=Q+ Ka2 Qb2#
Ne3 dxe3 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 umnov