Helpmate tablebases Every solution to every position, precomputed.

← all materials

KQPvkq

5 pieces.

h#9
longest mate
h#7
deepest unique
521
positions at that depth
h#8
deepest dual
h#6
deepest strict dual
404,343,693
positions with a helpmate
24,011,758
with a unique solution
355,074,048
cells in the plane
324,165,278 bytes
on disk

Deepest unique problems

Chosen from the first 500 of 521 positions at this depth.

Deepest dual problems

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

h#6

8/K7/8/k7/Q7/8/5P2/q7 b - - 0 1

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

  1. Kxa4 f4 Qe5 fxe5 Kb5 e6 Kc6 e7 Kd7 Kb6 Kc8 e8=Q#
  2. Qxa4 f4 Qe8 f5 Kb5 f6 Kc6 f7 Kd7 Kb6 Kc8 fxe8=Q#

pure model ideal mirror promotion excelsior excelsior:white phoenix nocheck

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

h#6

8/1K6/8/1k6/1Qq5/8/6P1/8 b - - 0 1

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

  1. Kxb4 g4 Kc5 g5 Kd6 g6 Qf7+ gxf7 Ke7 Kc6 Kd8 f8=Q#
  2. Qxb4 g4 Qf8 g5 Kc5 g6 Kd6 g7 Ke7 Kc6 Kd8 gxf8=Q#

pure model ideal mirror promotion excelsior excelsior:white phoenix

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

h#6

8/K7/8/k7/Qq6/8/5P2/8 b - - 0 1

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

  1. Kxa4 f4 Kb5 f5 Kc6 f6 Qe7+ fxe7 Kd7 Kb6 Kc8 e8=Q#
  2. Qxa4 f4 Qe8 f5 Kb5 f6 Kc6 f7 Kd7 Kb6 Kc8 fxe8=Q#

pure model ideal mirror promotion excelsior excelsior:white phoenix

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