Helpmate tablebases Every solution to every position, precomputed.

← all materials

KNPvk

4 pieces.

h#8.5
longest mate: h#7
deepest unique: 49
positions at that depth: h#7
deepest dual: h#6
deepest strict dual: 9,696,804
positions with a helpmate: 201,274
with a unique solution: 5,548,032
cells in the plane: 7,434,599 bytes
on disk

Deepest unique problems

h#7

8/8/8/8/8/N7/P7/3K3k b - - 0 1

Kg2 Nc2 Kf3 a4 Ke4 a5 Kd3 a6 Kc3 a7 Kb2 a8=Q Kb1 Qa1#

promotion excelsior excelsior:white single-piece single-piece:black nocapture nocheck

Published as Elkies (2004)

Elkies, Noam D. — The Problemist, No. H2793, 07/2004

h#7

8/8/8/8/8/5N2/K4P2/7k b - - 0 1

Kg2 Nd4 Kf1 f4 Ke1 f5 Kd2 f6 Kc3 f7 Kb4 f8=Q+ Ka4 Qa3#

promotion excelsior excelsior:white single-piece single-piece:black nocapture

h#7

8/8/8/8/8/k1K5/2P4N/8 b - - 0 1

Ka4 Kd4 Kb5 c4+ Kc6 c5 Kd7 c6+ Ke6 c7 Kf5 c8=Q+ Kf4 Qg4#

promotion excelsior excelsior:white single-piece single-piece:black nocapture umnov

Deepest dual problems

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

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

h#6

2K5/8/2N5/8/8/k7/6P1/8 b - - 0 1

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

Kb3 g4 Kc4 g5 Kd5 g6 Ke6 g7 Kf7 Kc7 Ke8 g8=Q#
Ka4 g4 Kb5 g5 Kxc6 g6 Kb6 g7 Ka7 g8=Q Ka8 Qa2#

pure model ideal mirror promotion excelsior excelsior:white single-piece single-piece:white single-piece:black nocheck