Helpmate tablebases Every solution to every position, precomputed.

← all materials

KRvkrb

5 pieces.

h#7
longest mate: h#6
deepest unique: 55
positions at that depth: h#6
deepest dual: h#5.5
deepest strict dual: 152,505,566
positions with a helpmate: 5,301,818
with a unique solution: 121,110,528
cells in the plane: 71,264,246 bytes
on disk

Deepest unique problems

h#6

8/7k/8/6R1/8/b7/4r3/K7 b - - 0 1

Bb2+ Ka2 Bg7+ Kb3 Kg8 Kc4 Kf8 Kd5 Be5 Ke6 Ke8 Rg8#

pure model mirror nocapture

h#6

8/3b4/6k1/6R1/8/8/3r4/K7 b - - 0 1

Kh7 Kb1 Rd6 Kc2 Rg6 Kd3 Be6 Ke4 Bg8 Kf5 Rg7 Rh5#

pure model ideal self-block nocapture nocheck

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

h#6

8/8/7k/8/8/8/b1r5/K6R b - - 0 1

Kg5 Rb1 Kf4 Rb2 Ke3 Kxa2 Kd2 Kb3 Kc1 Ra2 Rd2 Ra1#

pure model ideal self-block nocheck

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

Deepest dual problems

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

h#5.5

8/8/6R1/7k/1r6/b7/8/K7 w - - 0 1

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

Ra6 Kg4 Ka2 Kf3 Kxa3 Ke2 Kxb4 Kd1 Kc3 Kc1 Ra1#
Rh6+ Kg4 Ka2 Kf3 Kxa3 Ke2 Kxb4 Kd1 Kc3 Kc1 Rh1#

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

h#5.5

8/5k2/8/7b/7R/8/3r4/1K6 w - - 0 1

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

Kc1 Bg6 Rh8 Bh7 Kxd2 Kg6 Ke3 Kh5 Kf4 Kh4 Rxh7#
Rh1 Rh2 Kc1 Be2 Kd2 Kg6 Ke3 Kh5 Kf4 Kh4 Rxh2#

pure model ideal mirror nocheck

h#5.5

4k3/7R/8/8/8/8/b6r/1K6 w - - 0 1

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

Ka1 Kd8 Rxh2 Kc7 Kxa2 Kb6 Kb3 Ka5 Kc4 Ka4 Ra2#
Kc1 Rh6 Rh8+ Kf7 Kd2 Kg6 Ke3 Kh5 Kf4 Kh4 Rxh6#

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

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