Helpmate tablebases Every solution to every position, precomputed.

← all materials

KQRvkq

5 pieces.

h#7
longest mate
h#6
deepest unique
2
positions at that depth
h#5.5
deepest dual
h#5
deepest strict dual
121,257,290
positions with a helpmate
12,675,351
with a unique solution
121,110,528
cells in the plane
104,466,759 bytes
on disk

Deepest unique problems

Only 2 distinct ideas exist at this depth.

h#6

8/1qR5/6Qk/8/8/8/8/K7 b - - 0 1

  1. Kxg6 Ka2 Qd5+ Ka3 Qf7 Kb4 Kg7 Kc5 Kf8 Kd6 Ke8 Rc8#

pure model ideal self-block

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

h#6

8/3R4/6Qk/1q6/8/8/8/K7 b - - 0 1

  1. Kxg6 Ka2 Qe5 Kb3 Qg7 Kc4 Kh7 Kd5 Kg8 Ke6 Kf8 Rd8#

pure model ideal self-block nocheck

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#5. The deepest dual overall is h#5.5, where the two solutions share a first or a last move.

Only one distinct idea exists at this depth: 2 positions share a solution.

h#5

6R1/4k3/4Q3/5q2/8/8/8/3K4 b - - 0 1

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

  1. Kxe6 Ke2 Kf6 Rf8+ Kg5 Rxf5+ Kh4 Kf3 Kh3 Rh5#
  2. Qxe6 Re8+ Kf6 Rxe6+ Kg5 Ke2 Kh4 Kf3 Kh3 Rh6#

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.