Helpmate tablebases Every solution to every position, precomputed.

← all materials

KRBPvk

5 pieces.

h#8
longest mate: h#7
deepest unique: 17
positions at that depth: h#7
deepest dual: h#6
deepest strict dual: 514,385,155
positions with a helpmate: 54,405,729
with a unique solution: 355,074,048
cells in the plane: 368,684,155 bytes
on disk

Deepest unique problems

h#7

7k/6R1/8/8/8/B7/P7/2K5 b - - 0 1

Kxg7 Bb2+ Kf7 a4 Ke6 a5 Kd5 a6 Kc4 a7 Kb3 a8=B Ka2 Bd5#

pure model ideal promotion underpromotion excelsior excelsior:white single-piece single-piece:black

Note: the solution begins with a capture.

Published as Abdurahmanovic & Becker (2006)

Abdurahmanovic, Fadil; Becker, Richard — The Problemist, No. (R), 01/2006

h#7

1k6/R7/8/8/6B1/8/6P1/3K4 b - - 0 1

Kxa7 Bf3 Kb6 g4 Kc5 g5 Kd4 g6 Ke3 g7 Kf2 g8=Q Kf1 Qg2#

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

Note: the solution begins with a capture.

h#7

8/8/8/1B6/2K5/8/1RP5/k7 b - - 0 1

Kxb2 Kd5 Ka3 c4 Kb4 c5 Ka5 c6 Kb6 c7 Kb7 Kd6 Kc8 Ba6#

pure model ideal single-piece single-piece:black nocheck

Note: the solution begins with a capture.

Deepest dual problems

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

Only 2 distinct ideas exist at this depth.

h#6

8/7k/6R1/8/8/8/3P4/K3B3 b - - 0 1

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

Kh8 d4 Kh7 d5 Kh8 d6 Kh7 d7 Kh8 d8=Q+ Kh7 Qg8#
Kxg6 d4 Kf5 d5 Ke4 d6 Kd3 d7 Kc2 d8=Q Kc1 Qd2#

promotion excelsior excelsior:white switchback closed-walk single-piece single-piece:white single-piece:black pendulum

h#6

8/7k/6R1/8/6B1/8/1P6/K7 b - - 0 1

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

Kh8 b4 Kh7 b5 Kh8 b6 Kh7 b7 Kh8 b8=Q+ Kh7 Qg8#
Kxg6 b4 Kg5 b5 Kf4 b6 Ke3 b7 Kd2 b8=Q Kc1 Qb2#

promotion excelsior excelsior:white switchback closed-walk single-piece single-piece:white single-piece:black pendulum