Helpmate tablebases Every solution to every position, precomputed.

← all materials

KPvkqq

5 pieces.

h#9.5
longest mate
h#7.5
deepest unique
367
positions at that depth
h#7.5
deepest dual
h#6.5
deepest strict dual
210,211,322
positions with a helpmate
2,176,175
with a unique solution
355,074,048
cells in the plane
143,365,630 bytes
on disk

Deepest unique problems

h#7.5

8/7k/4q3/8/8/1P6/q7/K7 w - - 0 1

  1. Kxa2 Kg6 Ka3 Kf5 b4 Ke4 b5 Kd3 b6 Kc2 b7 Kb1 b8=Q+ Ka1 Qb2#

promotion single-piece single-piece:black

Note: the side to move is in check in the diagram; the solution begins with a capture.

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/7k/8/4q2P/8/K3q3 w - - 0 1

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

  1. Ka2 Qd1 h4 Kg4 h5 Kf3 h6 Ke2 h7 Kd2 h8=Q Kc1 Qb2#
  2. Kb2 Qd1 h4 Kg4 h5 Kf3 h6 Ke2 h7 Kd2 h8=Q Qee2 Qc3#

promotion self-block nocapture nocheck umnov

Note: the side to move is in check in the diagram.

h#6.5

8/8/7k/8/8/8/2P4q/1K1q4 w - - 0 1

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

  1. Ka2 Qb8 c4 Kg5 c5 Kf4 c6 Ke3 c7 Kd2 cxb8=Q Kc1 Qb2#
  2. Kb2 Qhh5 c4 Kg5 c5 Kf4 c6 Ke3 c7 Kd2 c8=Q Qhe2 Qc3#

promotion excelsior excelsior:white self-block nocheck

Note: the side to move is in check in the diagram.