Helpmate tablebases Every solution to every position, precomputed.

← all materials

KNNvkr

5 pieces.

h#10
longest mate
h#7
deepest unique
1
positions at that depth
h#6.5
deepest dual
h#6
deepest strict dual
83,873,181
positions with a helpmate
1,329,017
with a unique solution
121,110,528
cells in the plane
47,778,535 bytes
on disk

Deepest unique problems

Only one position exists at this depth.

Deepest dual problems

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

Only one position exists at this depth.

h#6

6Nk/7N/8/8/8/8/1r6/K7 b - - 0 1

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

  1. Rh2 Kb1 Rh1+ Kc2 Kg7 Kd3 Kg6 Ke4 Kh5 Kf5 Rh4 Nhf6#
  2. Rb8 Ka2 Ra8+ Kb3 Kg7 Kc4 Kf7 Kd5 Ke8 Ke6 Rd8 Ngf6#

self-block nocapture