Helpmate tablebases Every solution to every position, precomputed.

← all materials

KBPvkq

5 pieces.

h#8.5
longest mate: h#7
deepest unique: 75
positions at that depth: h#7.5
deepest dual: h#7
deepest strict dual: 464,777,855
positions with a helpmate: 10,971,979
with a unique solution: 355,074,048
cells in the plane: 295,657,766 bytes
on disk

Deepest unique problems

h#7

8/8/B7/8/8/K7/P4q2/6k1 b - - 0 1

Kg2 Kb4 Kf3 a4 Ke4 a5 Qb6+ axb6 Kd5 b7 Kc6 Bb5+ Kb6 b8=Q#

pure model ideal promotion excelsior excelsior:white kniest

h#7

8/8/8/8/4B3/8/4P3/qk1K4 b - - 0 1

Kb2+ Bb1 Kc3 e4 Kd4 e5 Ke3 e6 Kf4 e7 Kg5 e8=Q Kh6 Qg6#

pure model promotion excelsior excelsior:white single-piece single-piece:black nocapture umnov

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

h#7

8/8/8/2B5/K7/8/P7/1q4k1 b - - 0 1

Kf1 Bb4 Ke2 Kb5 Kd3 Kc6 Kc4 Kd6 Kb5 Kd5 Ka4 Kc4 Qb3+ axb3#

pure model ideal

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

Deepest dual problems

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

Only one distinct idea exists at this depth: 2 positions share a solution.

h#7

8/8/B7/8/K7/8/P6k/1q6 b - - 0 1

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

Qb7 Bb5 Kg3 Kb4 Kf4 a4 Ke5 a5 Kd6 a6 Kc7 axb7 Kb6 b8=Q#
Qb8 Bb5 Kg3 Kb4 Kf4 a4 Ke5 a5 Kd6 a6 Kc7 a7 Kb6 axb8=Q#

pure model ideal promotion excelsior excelsior:white nocheck