Helpmate tablebases Every solution to every position, precomputed.

← all materials

KNNvkb

5 pieces.

h#10
longest mate
h#6.5
deepest unique
21
positions at that depth
h#6.5
deepest dual
h#5.5
deepest strict dual
87,650,319
positions with a helpmate
1,268,986
with a unique solution
121,110,528
cells in the plane
53,875,070 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

7k/8/8/5b2/3N4/2K5/1N6/8 w - - 0 1

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

  1. Nd3 Bh3 Nf5 Kh7 Kd4 Kg6 Ke5 Kh5 Kf6 Bg4 Nf4#
  2. Nc4 Bc8 Ne6 Kg8 Kd4 Kf7 Ke5 Ke8 Kf6 Bd7 Nd6#

self-block nocapture nocheck umnov

h#5.5

5k2/8/8/8/8/3K4/8/NbN5 w - - 0 1

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

  1. Kc3 Ke7 Kb2 Kd6 Kxb1 Kc5 Ncb3+ Kb4 Nc5 Ka3 Nc2#
  2. Kc4 Ke7 Kb5 Kd6 Ka6 Kc5 Ncb3+ Kb4 Nc2+ Ka4 Nc5#

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

Note: the side to move is in check in the diagram.