Helpmate tablebases Every solution to every position, precomputed.

← all materials

KBBNvk

5 pieces.

h#8
longest mate
h#7
deepest unique
1
positions at that depth
h#6.5
deepest dual
h#5.5
deepest strict dual
86,461,822
positions with a helpmate
4,122,196
with a unique solution
121,110,528
cells in the plane
58,514,796 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#5.5. 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#5.5

5k1N/8/5B2/8/8/8/2K5/B7 w - - 0 1

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

  1. Ng6+ Kf7 Kd3 Kg8 Ke4 Kh7 Kf5 Kh6 Bg5+ Kh5 Nf4#
  2. Bg7+ Ke7 Ng6+ Kd6 Nf4 Kc5 Ne2 Kb4 Nc3 Ka3 Bf8#

mirror single-piece single-piece:black nocapture