Helpmate tablebases Every solution to every position, precomputed.

← all materials

KQBvkq

5 pieces.

h#7
longest mate
h#5.5
deepest unique
6
positions at that depth
h#5.5
deepest dual
h#4
deepest strict dual
125,824,123
positions with a helpmate
13,918,604
with a unique solution
121,110,528
cells in the plane
109,944,192 bytes
on disk

Deepest unique problems

Deepest dual problems

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

Only one position exists at this depth.

h#4

5k2/6B1/4Q3/8/8/6q1/2K5/8 b - - 0 1

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

  1. Kxg7 Kd2 Qg6 Ke3 Kh6 Kf4 Kh5 Qh3#
  2. Qxg7 Kd3 Qh8 Ke4 Kg7 Kf5 Kh7 Qg6#

pure model ideal self-block nocheck

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