Helpmate tablebases Every solution to every position, precomputed.

← all materials

KPPvkr

5 pieces.

h#8.5
longest mate: h#6.5
deepest unique: 784
positions at that depth: h#6.5
deepest dual: h#6.5
deepest strict dual: 199,850,920
positions with a helpmate: 5,222,208
with a unique solution: 266,305,536
cells in the plane: 117,164,227 bytes
on disk

Deepest unique problems

h#6.5

8/8/6r1/6k1/6P1/6P1/8/K7 w - - 0 1

Kb2 Rf6 Kc3 Rf5 gxf5 Kg4 f6 Kf3 f7 Ke2 f8=Q Kd1 Qf1#

pure model mirror promotion nocheck umnov

h#6.5

8/6k1/8/8/8/8/1PP5/K2r4 w - - 0 1

Ka2 Kf6 b4 Ke5 b5 Kd4 b6 Kc3 b7 Kxc2 b8=Q Kc1 Qb2#

promotion excelsior excelsior:white closed-walk single-piece single-piece:black nocheck

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

h#6.5

6k1/8/8/8/1r6/6P1/1P6/K7 w - - 0 1

g4 Kf7 g5 Ke6 g6 Kd5 g7 Kc4 b3+ Kxb3 g8=Q+ Ka3 Qa2#

promotion single-piece single-piece:black

Chosen from the first 500 of 784 positions at this depth.

Deepest dual problems

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

h#6.5

3K4/3r4/8/8/8/8/1P2P1k1/8 w - - 0 1

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

Kc8 Kf2 e4 Ke3 e5 Kd4 e6 Kc5 exd7 Kb6 d8=Q+ Ka7 Qa5#
Ke8 Kg3 b4 Kf4 b5 Ke5 b6 Kd6 b7 Kc7 Kf8 Kd8 b8=Q#

pure model mirror promotion excelsior excelsior:white single-piece single-piece:black

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