Helpmate tablebases Every solution to every position, precomputed.

← all materials

KRvkbp

5 pieces.

h#7
longest mate: h#6
deepest unique: 817
positions at that depth: h#6
deepest dual: h#6
deepest strict dual: 504,751,675
positions with a helpmate: 22,181,717
with a unique solution: 355,074,048
cells in the plane: 222,817,809 bytes
on disk

Deepest unique problems

h#6

8/8/7k/6p1/6R1/8/8/K1b5 b - - 0 1

Kh5 Rxg5+ Kh4 Rh5+ Kg3 Kb1 Kf2 Kc2 Ke1 Kd3 Kd1 Rh1#

single-piece single-piece:black umnov

h#6

8/8/6Rk/7b/8/1p6/8/K7 b - - 0 1

Kh7 Kb2 Kh8 Kc3 b2 Kd4 b1=R Ke5 Rb8 Kf6 Rg8 Rh6#

pure model promotion underpromotion self-block nocapture nocheck umnov

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

h#6

8/4Rk2/8/8/8/p7/2b5/K7 b - - 0 1

Kg8 Ka2 Bh7 Kb3 a2 Kc4 a1=R Kd5 Rg1 Ke6 Rg7 Re8#

pure model ideal promotion underpromotion self-block nocapture nocheck umnov

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

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

Deepest dual problems

h#6

6k1/5R2/8/8/8/bp6/8/K7 b - - 0 1

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

Bb2+ Kxb2 Kh8 Kc3 b2 Kd4 b1=R Ke5 Rh1 Kf6 Rh7 Rf8#
Bf8 Kb2 Kh8 Kc3 b2 Kd4 b1=R Ke5 Rh1 Kf6 Rh7 Rxf8#

pure model ideal promotion underpromotion self-block umnov

h#6

K1b5/8/8/4p3/8/6R1/8/7k b - - 0 1

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

Bh3 Kb7 e4 Kc6 e3 Kd5 e2 Ke4 e1=R+ Kf3 Rg1 Rxh3#
Bb7+ Kxb7 e4 Kc6 e3 Kd5 e2 Ke4 e1=R+ Kf3 Rg1 Rh3#

pure model ideal promotion underpromotion self-block

h#6

7k/8/6R1/8/p7/8/8/K1b5 b - - 0 1

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

Bb2+ Kxb2 a3+ Kc3 a2 Kd4 a1=R Ke5 Ra8 Kf6 Rg8 Rh6#
Bh6 Kb2 a3+ Kc3 a2 Kd4 a1=R Ke5 Ra8 Kf6 Rg8 Rxh6#

pure model ideal promotion underpromotion self-block