Helpmate tablebases Every solution to every position, precomputed.

← all materials

KQPvkb

5 pieces.

h#9
longest mate
h#8
deepest unique
4
positions at that depth
h#8
deepest dual
h#4.5
deepest strict dual
466,945,289
positions with a helpmate
29,125,981
with a unique solution
355,074,048
cells in the plane
345,042,416 bytes
on disk

Deepest unique problems

h#8

8/8/1K6/8/2b5/2P5/7Q/7k b - - 0 1

  1. Kxh2 Ka5 Bd5 c4 Kg3 cxd5 Kf4 d6 Ke5 d7 Kd6 Kb5 Kc7 Ka6 Kb8 d8=Q#

pure model ideal mirror promotion phoenix nocheck umnov

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#4.5. The deepest dual overall is h#8, where the two solutions share a first or a last move.

h#4.5

8/8/8/8/7k/2b5/1P4Q1/K7 w - - 0 1

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

  1. Kb1 Bxb2 Qxb2 Kg3 Kc2 Kf2 Kd3+ Ke1 Qe2#
  2. Qa8 Kg3 Kb1 Kf2 Kc2 Ke1 Kd3 Kd1 Qa1#

pure model mirror single-piece single-piece:black

h#4.5

8/8/2b5/8/7k/8/1P4Q1/K7 w - - 0 1

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

  1. Qh3+ Kg5 b4 Kf6 b5 Ke7 bxc6 Kd8 Qd7#
  2. Qxc6 Kg3 Kb1 Kf2 Kc2 Ke1 Kd3 Kd1 Qh1#

pure model mirror single-piece single-piece:black

h#4.5

5k2/6b1/4Q3/8/8/4P3/8/K7 w - - 0 1

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

  1. Ka2 Bf6 Qg8+ Ke7 Kb3 Kd6 Kc4 Ke5 Qd5#
  2. Qf6+ Ke8 e4 Bf8 e5 Be7 e6 Bd8 Qf7#

self-block nocapture

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