Helpmate tablebases Every solution to every position, precomputed.

← all materials

KRRPvk

5 pieces.

h#7
longest mate: h#6
deepest unique: 5
positions at that depth: h#6
deepest dual: h#4.5
deepest strict dual: 246,380,641
positions with a helpmate: 30,785,520
with a unique solution: 355,074,048
cells in the plane: 105,649,590 bytes
on disk

Deepest unique problems

h#6

7k/7R/6R1/8/8/8/5P2/K7 b - - 0 1

Kxh7 f4 Kh8 f5 Kh7 f6 Kh8 f7 Kh7 Rg7+ Kh8 f8=Q#

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

Note: the side to move is in check in the diagram; the solution begins with a capture.

h#6

K7/8/8/8/8/8/4PR2/6kR b - - 0 1

Kxh1 e4 Kg1 e5 Kh1 e6 Kg1 e7 Kh1 e8=Q Kg1 Qe1#

promotion excelsior excelsior:white switchback single-piece single-piece:white single-piece:black pendulum nocheck

Note: the side to move is in check in the diagram; the solution begins with a capture.

h#6

K7/8/8/8/8/6P1/5R2/6Rk b - - 0 1

Kxg1 g4 Kh1 g5 Kg1 g6 Kh1 g7 Kg1 g8=Q+ Kh1 Qg2#

pure model promotion switchback single-piece single-piece:white single-piece:black pendulum

Note: the side to move is in check in the diagram; the solution begins with a capture.

Deepest dual problems

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

Only one position exists at this depth.

h#4.5

2K5/8/8/8/8/8/5RRP/7k w - - 0 1

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

Rf7 Kxg2 Kd7 Kh3 Ke6 Kh4 Kf5 Kh5 Rh7#
Rf8 Kxg2 Kd7 Kh3 Ke6 Kh4 Kf5 Kh5 Rh8#

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