Helpmate tablebases Every solution to every position, precomputed.

← all materials

KNvknp

5 pieces.

h#10
longest mate: h#8.5
deepest unique: 1
positions at that depth: h#8.5
deepest dual: h#7.5
deepest strict dual: 556,737,651
positions with a helpmate: 1,743,660
with a unique solution: 355,074,048
cells in the plane: 218,622,533 bytes
on disk

Deepest unique problems

Only one position exists at this depth.

h#8.5

N5k1/8/8/8/8/1p6/8/Kn6 w - - 0 1

Kb2 Nc3 Ka3 Kf7 Kb4 Ke6 Ka5 Kd5 Kb6 Kc4 Ka6 Kb4 Nb6 Ka3 Ka5 Na2 Nc4#

set-play pure model ideal closed-walk self-block nocapture nocheck

Published as Sheglow (1998)

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

Deepest dual problems

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

Only one position exists at this depth.

h#7.5

8/1K1p4/8/3k4/4N3/8/8/7n w - - 0 1

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

Nc5 Nf2 Nd3 Ke4 Kc7 Kf3 Kd6 Kg2 Ke5 Kh1 Kf4 Nh3+ Kg3 Ng1 Nf2#
Nd6 Ng3 Nf5 Ke4 Kb6 Kf3 Kc5 Kg2 Kd4 Kh1 Ke3 Nf1+ Kf2 Nh2 Ng3#

pure model self-block nocapture