Helpmate tablebases Every solution to every position, precomputed.

← all materials

KBPvkb

5 pieces.

h#10
longest mate: h#7
deepest unique: 65
positions at that depth: h#7
deepest dual: h#7
deepest strict dual: 527,523,465
positions with a helpmate: 14,927,069
with a unique solution: 355,074,048
cells in the plane: 341,364,844 bytes
on disk

Deepest unique problems

h#7

7k/6b1/8/8/3B4/8/3P4/K7 b - - 0 1

Kh7 Bc3 Kg6 d4 Kf5 d5 Ke4 d6 Kd3 d7 Kc2 d8=Q Kc1 Qd2#

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

h#7

7k/8/8/8/8/b7/PB6/2K5 b - - 0 1

Kg8 Kb1 Bb4 a4 Kf7 a5 Ke6 a6 Kd5 a7 Kc4 a8=Q Kb3 Qa2#

promotion excelsior excelsior:white closed-walk self-block nocapture nocheck

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

h#7

8/7k/8/7B/b7/K7/P7/8 b - - 0 1

Bb3 axb3 Kh6 b4 Kg5 b5 Kf4 b6 Ke3 b7 Kd2 b8=Q Kc1 Qb2#

pure model ideal promotion excelsior excelsior:white single-piece single-piece:white nocheck

Deepest dual problems

Only 2 distinct ideas exist at this depth.

h#7

8/8/8/3b4/7k/K7/P7/3B4 b - - 0 1

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

Bh1 Kb3 Kg3 a4 Kf2 a5 Ke1 a6 Kxd1 a7 Kc1 a8=Q Kb1 Qxh1#
Bb3 Kxb3 Kg3 a4 Kf2 a5 Ke1 a6 Kxd1 a7 Kc1 a8=Q Kb1 Qh1#

pure model ideal mirror promotion excelsior excelsior:white nocheck

h#7

6B1/8/7k/3b4/8/K7/P7/8 b - - 0 1

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

Bh1 Kb3 Kg5 a4 Kf4 a5 Ke3 a6 Kd2 a7 Kc1 a8=Q Kb1 Qxh1#
Bb3 Kxb3 Kg5 a4 Kf4 a5 Ke3 a6 Kd2 a7 Kc1 a8=Q Kb1 Qh1#

pure mirror promotion excelsior excelsior:white nocheck