Helpmate tablebases Every solution to every position, precomputed.

← all materials

KRvkpp

5 pieces.

h#7
longest mate: h#6
deepest unique: 1,085
positions at that depth: h#6
deepest dual: h#6
deepest strict dual: 199,880,833
positions with a helpmate: 10,789,674
with a unique solution: 266,305,536
cells in the plane: 80,350,210 bytes
on disk

Deepest unique problems

h#6

8/8/8/6pk/6R1/8/2p5/K7 b - - 0 1

c1=B Rxg5+ Kh4 Rh5+ Kg3 Kb1 Kf2 Kc2 Ke1 Kd3 Kd1 Rh1#

set-play promotion underpromotion umnov

h#6

8/8/p5k1/R7/p7/8/8/K7 b - - 0 1

Kh7 Kb2 a3+ Kc3 a2 Kd4 a1=R Ke5 Rg1 Kf6 Rg8 Rh5#

pure model promotion underpromotion self-block nocapture

h#6

6kR/8/8/8/8/p6p/8/K7 b - - 0 1

Kg7 Kb1 h2 Kc2 h1=R Kd3 Rh7 Ke4 Kh6 Kf5 Kh5 Rxh7#

pure model mirror promotion underpromotion nocheck

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

Chosen from the first 500 of 1,085 positions at this depth.

Deepest dual problems

h#6

7k/8/8/6Rp/p7/8/8/K7 b - - 0 1

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

Kh7 Kb2 a3+ Kc3 a2 Kd4 a1=R Ke5 Ra8 Kf6 Rg8 Rxh5#
h4 Kb2 a3+ Kc3 a2 Kd4 a1=R Ke5 Ra8 Kf6 Rg8 Rh5#

set-play pure model ideal promotion underpromotion self-block

h#6

7k/8/6Rp/8/8/1p6/8/K7 b - - 0 1

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

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

set-play pure model ideal promotion underpromotion switchback self-block nocheck umnov

h#6

7k/7p/6R1/8/p7/8/8/K7 b - - 0 1

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

h6 Kb2 a3+ Kc3 a2 Kd4 a1=R Ke5 Ra8 Kf6 Rg8 Rxh6#
h5 Kb2 a3+ Kc3 a2 Kd4 a1=R Ke5 Ra8 Kf6 Rg8 Rh6#

pure model ideal promotion underpromotion self-block