Helpmate tablebases Every solution to every position, precomputed.

← all materials

KNPvkn

5 pieces.

h#9
longest mate: h#7.5
deepest unique: 2
positions at that depth: h#7.5
deepest dual: h#6.5
deepest strict dual: 556,739,047
positions with a helpmate: 10,396,426
with a unique solution: 355,074,048
cells in the plane: 308,672,996 bytes
on disk

Deepest unique problems

Only one distinct idea exists at this depth: 2 positions share a solution.

h#7.5

N7/K7/8/7n/8/8/P7/7k w - - 0 1

a4 Nf6 a5 Nd7 a6 Nb8 Kb6 Kg2 a7 Kf3 axb8=Q Ke4 Qf4+ Kd5 Nc7#

pure model ideal mirror promotion excelsior excelsior:white

Published as Paliulionis (2024)

Paliulionis, Viktoras — Sachmatija, No. H5293, 01-03/2024

Deepest dual problems

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

h#6.5

8/8/8/8/8/4k3/3NP3/K1n5 w - - 0 1

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

Kb2 Kd4 Ka3 Kc3 Ka4 Kb2 Kb4 Ka2 Kc3 Ka1 Kc2 Na2 Nb3#
Nf3 Kf4 e4 Nd3 e5 Nc5 e6 Nd7 exd7 Kg4 d8=Q Kh5 Qg5#

pure model promotion excelsior excelsior:white self-block nocheck

h#6.5

8/8/6k1/8/N7/6n1/6P1/K7 w - - 0 1

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

Nb2 Nh5 g4 Kg5 gxh5 Kf4 h6 Ke3 h7 Kd2 h8=Q Kc1 Qc3#
Nb6 Nh5 g4 Kf6 gxh5 Ke5 h6 Kd4 h7 Kc3 h8=Q+ Kb3 Qb2#

pure model ideal promotion excelsior excelsior:white

h#6.5

8/3k4/8/8/8/N6n/P7/K7 w - - 0 1

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

Nc2 Nf4 a4 Nd5 a5 Nb6 axb6 Kc6 b7 Kb5 b8=Q+ Ka4 Qb4#
Nc4 Nf4 a4 Nd5 a5 Nb6 axb6 Kc6 b7 Kb5 b8=Q+ Ka6 Qb6#

promotion excelsior excelsior:white closed-walk