Helpmate tablebases Every solution to every position, precomputed.

← all materials

KRRvkr

5 pieces.

h#7
longest mate
h#6
deepest unique
1
positions at that depth
h#6
deepest dual
h#3.5
deepest strict dual
72,578,329
positions with a helpmate
7,338,322
with a unique solution
121,110,528
cells in the plane
37,283,688 bytes
on disk

Deepest unique problems

Only one position exists at this depth.

h#6

4kR2/7R/8/8/8/8/6r1/1K6 b - - 0 1

  1. Kxf8 Kc1 Rg7 Kd2 Kf7 Ke3 Kg6 Rxg7+ Kh5 Kf4 Kh4 Rh7#

pure model ideal mirror switchback

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#3.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#3.5

8/7R/5k2/7R/8/8/r7/K7 w - - 0 1

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

  1. Kb1 Kg6 Rh1 Rh2 Rg7+ Kh5 Rxh2#
  2. Kxa2 Ke6 Kb3 Kd6 Kc4 Kc6 R5h6#

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

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