Helpmate tablebases Every solution to every position, precomputed.

← all materials

KPvkqn

5 pieces.

h#9.5
longest mate
h#8.5
deepest unique
1
positions at that depth
h#8
deepest dual
h#7.5
deepest strict dual
486,907,157
positions with a helpmate
4,501,794
with a unique solution
355,074,048
cells in the plane
226,355,141 bytes
on disk

Deepest unique problems

Only one position exists at this depth.

Deepest dual problems

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

Only one position exists at this depth.

h#7.5

8/8/6k1/8/2n5/2q5/2P5/2K5 w - - 0 1

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

  1. Kb1 Qd2 Ka1 Nb6 c4 Kf5 c5 Ke4 cxb6 Kd3 b7 Kc2 b8=Q Kc1 Qb1#
  2. Kd1 Qb2 Ke1 Nd6 c4 Kf5 c5 Ke4 cxd6 Kd3 d7 Kc2 d8=Q Kc1 Qd1#

promotion excelsior excelsior:white self-block nocheck umnov