Helpmate tablebases Every solution to every position, precomputed.

← all materials

KPvknp

5 pieces.

h#14.5
longest mate: h#9
deepest unique: 4
positions at that depth: h#9.5
deepest dual: h#8
deepest strict dual: 428,013,683
positions with a helpmate: 4,835,214
with a unique solution: 266,305,536
cells in the plane: 188,181,177 bytes
on disk

Deepest unique problems

h#9

6k1/8/7n/8/8/p7/P7/K7 b - - 0 1

Nf5 Kb1 Nd4 Kc1 Nb3+ axb3 Kf7 b4 Ke6 b5 Kd5 b6 Kc4 b7 Kb3 b8=Q+ Ka2 Qb1#

promotion excelsior excelsior:white

h#9

8/7k/n7/8/7p/8/K6P/8 b - - 0 1

Nc5 Kb2 Ne4 Ka3 Ng3 hxg3 Kg6 gxh4 Kf5 h5 Ke4 h6 Kd3 h7 Kc2 h8=Q Kb1 Qb2#

promotion excelsior excelsior:white nocheck

h#9

K7/8/n7/8/8/7p/7P/5k2 b - - 0 1

Nc5 Kb8 Ne4 Kc7 Ng3 hxg3 Ke2 g4 Kd3 g5 Kc4 g6 Kb5 g7 Ka6 g8=Q Ka7 Qa2#

pure model mirror promotion excelsior excelsior:white nocheck

Deepest dual problems

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

Only one position exists at this depth.

h#8

K7/1n6/8/8/6p1/6P1/4k3/8 b - - 0 1

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

Nc5 Kb8 Nd3 Kc7 Nf4 gxf4 Kd3 f5 Kc4 f6 Kb5 f7 Ka6 f8=Q Ka7 Qa3#
Nd6 Kb8 Nf5 Kc7 Nh4 gxh4 Kd3 h5 Kc4 h6 Kb5 h7 Ka6 h8=Q Ka7 Qa1#

pure model mirror promotion nocheck