Helpmate tablebases Every solution to every position, precomputed.

← all materials

KPvkqp

5 pieces.

h#14.5
longest mate
h#8.5
deepest unique
9
positions at that depth
h#10.5
deepest dual
h#7.5
deepest strict dual
371,791,085
positions with a helpmate
4,110,002
with a unique solution
266,305,536
cells in the plane
226,781,247 bytes
on disk

Deepest unique problems

h#8.5

8/7k/q7/8/7p/8/7P/K7 w - - 0 1

  1. Kb2 Qg6 Ka3 Qg3+ hxg3 Kg6 gxh4 Kf5 h5 Ke4 h6 Kd3 h7 Kc2 h8=Q Kb1 Qb2#

promotion excelsior excelsior:white

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

Deepest dual problems

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

h#7.5

8/7k/6q1/8/8/2p5/1KP5/8 w - - 0 1

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

  1. Ka3 Qd3 cxd3 Kg6 d4 Kf5 d5 Ke4 d6 Kd3 d7 Kc2 d8=Q Kb1 Qd1#
  2. Kxc3 Kh6 Kb3 Kg5 c4 Kf4 c5 Ke3 c6 Kd2 c7 Kc1 c8=Q+ Qc2+ Qxc2#

pure model mirror promotion excelsior excelsior:white closed-walk

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

h#7.5

6k1/8/8/2p5/8/8/qKP5/8 w - - 0 1

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

  1. Kc1 Qb3 cxb3 Kf7 b4 Ke6 b5 Kd5 b6 Kc4 b7 Kb3 b8=Q+ Ka2 Qb2#
  2. Kc3 Qb3+ cxb3 Kf7 b4 Ke6 bxc5 Kd5 c6 Kc5 c7 Kb5 c8=Q Ka4 Qa6#

pure model ideal mirror promotion excelsior excelsior:white umnov

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