Helpmate tablebases Every solution to every position, precomputed.

โ† all materials

KNvkn

4 pieces.

h#10
longest mate
h#7.5
deepest unique
14
positions at that depth
h#8
deepest dual
h#6.5
deepest strict dual
3,134,443
positions with a helpmate
5,273
with a unique solution
1,892,352
cells in the plane
1,219,754 bytes
on disk

Deepest unique problems

h#7.5

5n2/8/8/8/8/8/3k2N1/K7 w - - 0 1

  1. Nh4 Ke3 Kb2 Kf4 Kc3 Kg5 Kd4 Kh6 Ke5 Kh7 Kf6 Kh8 Kf7 Nh7 Ng6#

pure model ideal self-block nocapture nocheck

Published as Kotesovec (1987)

  • Kotesovec, Vaclav โ€” Sachova skladba, No. 1065, 06/1987
  • ?, ? โ€” ?, 03/1975

Deepest dual problems

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

Only one position exists at this depth.

h#6.5

8/8/6n1/8/8/2kN4/8/K7 w - - 0 1

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

  1. Kb1 Nf4 Kc1 Ne2+ Kd1 Nc1 Nc5 Kb2 Kd2 Ka1 Kc2 Na2 Nb3#
  2. Ka2 Ne5 Ka3 Nc4+ Ka4 Na3 Ne1 Kb2 Kb4 Ka1 Kb3 Nb1 Nc2#

pure model ideal self-block nocapture umnov