Helpmate tablebases Every solution to every position, precomputed.

← all materials

KBBvkp

5 pieces.

h#16
longest mate: h#9
deepest unique: 1
positions at that depth: h#9
deepest dual: h#7.5
deepest strict dual: 265,038,047
positions with a helpmate: 7,275,714
with a unique solution: 355,074,048
cells in the plane: 111,312,327 bytes
on disk

Deepest unique problems

Only one position exists at this depth.

h#9

3K4/1B6/2B5/8/1k6/8/5p2/8 b - - 0 1

Kc5 Bc8 Kxc6 Ke7 Kd5 Kf6 Ke4 Kg5 Kf3 Kh4 Kg2 Bh3+ Kh1 Kg3 f1=N+ Kf2 Nh2 Bg2#

pure model ideal promotion underpromotion self-block umnov

Deepest dual problems

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

h#7.5

8/8/8/4k1B1/2p5/8/5B2/1K6 w - - 0 1

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

Bg3+ Kd4 Kc1 Kc3 Kd1 Kb2 Bc1+ Ka1 Kc2 c3 Bb2+ cxb2 Kb3 b1=B Be5#
Bfh4 Kd4 Kc1 Kc3 Kd1 Kb2 Bc1+ Ka1 Kc2 c3 Bb2+ cxb2 Kb3 b1=B Bf6#

promotion underpromotion self-block

h#7.5

8/6k1/2p5/8/8/8/K6B/6B1 w - - 0 1

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

Bc5 Kh8 Bb4 c5 Kb3 cxb4 Kc4 b3 Kd5 b2 Ke6 b1=B Kf7 Bh7 Be5#
Bd6 Kh8 Bb4 c5 Kb3 cxb4 Kc4 b3 Kd5 b2 Ke6 b1=B Kf7 Bh7 Bd4#

promotion underpromotion self-block nocheck umnov zilahi

h#7.5

8/8/5B1k/4B3/8/2p5/1K6/8 w - - 0 1

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

Kc2 Kg6 Bg5 Kh7 Bd2 cxd2 Kd3 d1=B Ke4 Bb3 Kf5 Bg8 Kf6 Kh8 Kg6#
Kb3 Kh7 Bg5 Kg8 Bd2 cxd2 Kc4 d1=B Kd5 Bc2 Ke6 Bh7 Kf6 Kh8 Kf7#

promotion underpromotion self-block nocheck

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