Helpmate tablebases Every solution to every position, precomputed.

← all materials

KQQvkp

5 pieces.

h#7
longest mate
h#6
deepest unique
6
positions at that depth
h#6
deepest dual
h#4
deepest strict dual
215,518,695
positions with a helpmate
36,190,809
with a unique solution
355,074,048
cells in the plane
186,481,161 bytes
on disk

Deepest unique problems

Deepest dual problems

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

h#4

8/5p2/6Qk/8/8/K7/Q7/8 b - - 0 1

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

  1. Kxg6 Kb4 Kg7 Kc5 Kf8 Kd6 Ke8 Qa8#
  2. fxg6 Kb4 Kg7 Kc5 Kf8 Kd6 Ke8 Qg8#

pure model ideal mirror single-piece single-piece:black nocheck

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

h#4

8/2K5/3Q4/8/8/6p1/5Q2/5k2 b - - 0 1

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

  1. Kxf2 Kd7 Kg2 Ke6 Kh3 Kf5 Kh4 Qh6#
  2. gxf2 Kd7 Kg2 Ke6 Kh3 Kf5 Kh4 Qh2#

pure model mirror single-piece single-piece:black nocheck

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

h#4

8/5p2/6Qk/8/2Q5/1K6/8/8 b - - 0 1

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

  1. Kxg6 Kb4 Kg7 Kc5 Kf8 Kd6 Ke8 Qc8#
  2. fxg6 Kb4 Kg7 Kc5 Kf8 Kd6 Ke8 Qg8#

pure model mirror single-piece single-piece:black nocheck

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