Helpmate tablebases Every solution to every position, precomputed.

← all materials

KNNvkq

5 pieces.

h#8.5
longest mate
h#7
deepest unique
1
positions at that depth
h#7.5
deepest dual
h#5.5
deepest strict dual
77,145,508
positions with a helpmate
829,906
with a unique solution
121,110,528
cells in the plane
44,170,856 bytes
on disk

Deepest unique problems

Only one position exists at this depth.

h#7

k7/8/8/2q5/7N/3K4/7N/8 b - - 0 1

  1. Kb7 Ke4 Kc6 Kf4 Kd5 Kg5 Ke6+ Kh6 Kf7 Ng4 Kg8 Nf6+ Kh8 Ng6#

mirror single-piece single-piece:black nocapture

Published as Sheglow (1998)

  • Sheglow, Wiktor S. — Suomen Tehtäväniekat, No. (269), 05-06/1998

Deepest dual problems

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

h#5.5

5N2/8/7k/8/3q4/N7/8/K7 w - - 0 1

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

  1. Kb1 Kg5 Nb5 Kf4 Ne6+ Ke3 Nexd4 Kd2 Nf3+ Kd1 Nc3#
  2. Ka2 Kg5 Nd7 Kf4 Nc5 Ke3 Nc2+ Kd2 Ne3 Kc1 Nb3#

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

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

h#5.5

8/5k2/8/1N6/8/3q4/N7/1K6 w - - 0 1

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

  1. Ka1 Ke6 Nc1 Kd5 Nxd3 Kc4 Nc5 Kb4 Nd4 Ka3 Nc2#
  2. Kb2 Ke6 Nc1 Kd5 Nxd3 Kc4 Ne5+ Kb4 Nc6+ Ka4 Nc3#

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

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

h#5.5

8/6k1/8/4N1q1/6N1/8/8/1K6 w - - 0 1

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

  1. Nf6 Kh6 Kc2 Qg2+ Kd3 Kg5 Ke3 Kh4 Kf4 Qh3 Ng6#
  2. Nd3 Kg6 Kc2 Kh5 Kd1 Kh4 Ke2 Kh3 Kf3 Qh4 Nf4#

self-block nocapture