Helpmate tablebases Every solution to every position, precomputed.

← all materials

KQRvkn

5 pieces.

h#7
longest mate
h#6
deepest unique
4
positions at that depth
h#6
deepest dual
h#5
deepest strict dual
147,164,248
positions with a helpmate
16,102,857
with a unique solution
121,110,528
cells in the plane
95,439,528 bytes
on disk

Deepest unique problems

Deepest dual problems

Deepest dual with different first and last moves: h#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#5

4kQ2/8/3R2n1/8/8/8/8/2K5 b - - 0 1

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

  1. Kxf8 Kd2 Kg7 Ke3 Kh6 Rxg6+ Kh5 Kf4 Kh4 Rh6#
  2. Nxf8 Rd1 Kf7 Kd2 Kg6 Ke3 Kh5 Kf4 Kh4 Rh1#

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

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