Helpmate tablebases Every solution to every position, precomputed.

← all materials

KPvkpp

5 pieces.

h#15.5
longest mate: h#10
deepest unique: 2
positions at that depth: h#10.5
deepest dual: h#8
deepest strict dual: 163,258,252
positions with a helpmate: 2,054,721
with a unique solution: 199,729,152
cells in the plane: 103,957,001 bytes
on disk

Deepest unique problems

Only 2 distinct ideas exist at this depth.

h#10

6k1/8/8/8/1p2p3/8/4P3/K7 b - - 0 1

b3 Kb1 b2 Kc2 b1=B+ Kc1 Bd3 exd3 Kf7 dxe4 Ke6 e5 Kd5 e6 Kc4 e7 Kb3 e8=Q Ka2 Qa4#

pure model ideal mirror promotion underpromotion excelsior excelsior:white umnov

Published as Ban (1967)

Ban, Jenö — Stella Polaris, No. 1072, 06/1967; Ideal-Mate Encyclopedia Vol.1, No. 70, 1999

h#10

8/7k/8/8/4p3/2p5/2P5/2K5 b - - 0 1

e3 Kb1 e2 Ka2 e1=N Ka3 Nd3 cxd3 Kg6 d4 Kf5 d5 Ke4 d6 Kd3 d7 Kc2 d8=Q Kb1 Qd1#

pure model mirror promotion underpromotion excelsior excelsior:white nocheck

Deepest dual problems

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

Only 2 distinct ideas exist at this depth.

h#8

6k1/8/8/2p5/8/8/1KP1p3/8 b - - 0 1

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

e1=N Kc3 Nd3 cxd3 Kf7 d4 Ke6 dxc5 Kd5 c6 Kc5 c7 Kb5 c8=Q Ka4 Qa6#
e1=B Kc1 Bb4 c3 Kf7 cxb4 Ke6 b5 Kd5 b6 Kc4 b7 Kb3 b8=Q+ Ka2 Qb2#

pure model ideal mirror promotion underpromotion excelsior excelsior:white umnov

h#8

6k1/8/3p4/8/8/8/2KP1p2/8 b - - 0 1

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

f1=N Kc1 Ne3 dxe3 Kf7 e4 Ke6 e5 Kd5 e6 Kc4 e7 Kb3 e8=Q Ka2 Qa4#
f1=B Kc3 Bc4 d3 Kf7 dxc4 Ke6 c5 Kd5 c6 Kc5 c7 Kb5 c8=Q Ka4 Qa6#

pure model mirror promotion underpromotion excelsior excelsior:white nocheck umnov