Helpmate tablebases Every solution to every position, precomputed.

← all materials

KNNvkn

5 pieces.

h#7.5
longest mate
h#6.5
deepest unique
2
positions at that depth
h#6.5
deepest dual
h#5.5
deepest strict dual
90,134,164
positions with a helpmate
1,106,273
with a unique solution
121,110,528
cells in the plane
50,463,455 bytes
on disk

Deepest unique problems

Only 2 distinct ideas exist at this depth.

Deepest dual problems

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

h#5.5

5NN1/8/8/5n2/8/2K5/8/3k4 w - - 0 1

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

  1. Ne6 Nh4 Kd4 Ke2 Ke5 Kf3 Kf6 Kg4 Kg7 Kh5 Nf6#
  2. Nh7 Nh4 Kd4 Ke2 Ke5 Kf3 Kf6 Kg4 Kg7 Kh5 Ngf6#

pure model ideal self-block nocapture nocheck

h#5.5

7N/8/5n2/8/1k6/3K3N/8/8 w - - 0 1

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

  1. Nf4 Ne8 Ke4 Kc5 Kf5 Kd6 Kg6 Ke7 Kh7 Kf8 Nfg6#
  2. Ng5 Ne8 Ke4 Kc5 Kf5 Kd6 Kg6 Ke7 Kh7 Kf8 Ng6#

pure model ideal self-block nocapture nocheck