Helpmate tablebases Every solution to every position, precomputed.

← all materials

KNNvk

4 pieces.

h#8
longest mate
h#6.5
deepest unique
9
positions at that depth
h#6.5
deepest dual
h#5
deepest strict dual
1,572,652
positions with a helpmate
20,936
with a unique solution
1,892,352
cells in the plane
1,421,837 bytes
on disk

Deepest unique problems

h#6.5

1k5N/8/8/8/8/8/7N/3K4 w - - 0 1

  1. Ke2 Kc7 Kf3 Kd6 Kg4 Ke5 Kh5 Kf4 Ng6+ Kg3 Nf1+ Kh3 Nf4#

pure model ideal mirror single-piece single-piece:black nocapture

Published as Bebesi (1910)

  • Bebesi, Gyula — Diagramme und Figuren, No. 1910, 12/12/1966; Catalogue h# (CHM) avec 6 pieces, No. 624, 1995; Ideal-Mate Encyclopedia Vol.1, No. 930, 1999

Deepest dual problems

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

Only 2 distinct ideas exist at this depth.