Helpmate tablebases Every solution to every position, precomputed.

← all materials

KQvkqq

5 pieces.

h#7.5
longest mate
h#5.5
deepest unique
58
positions at that depth
h#5.5
deepest dual
h#5
deepest strict dual
54,916,464
positions with a helpmate
2,386,455
with a unique solution
121,110,528
cells in the plane
50,642,353 bytes
on disk

Deepest unique problems

h#5.5

8/7k/8/8/8/1q6/Q7/K2q4 w - - 0 1

  1. Qb1+ Qdd3 Qe1 Qf7 Kb2 Qdg6 Kc3 Kg7 Kd4 Kf6 Qe5#

pure model ideal self-block nocapture

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

h#5.5

8/8/5k2/8/6Q1/q7/8/Kq6 w - - 0 1

  1. Kxb1 Qd3+ Kc1 Qg6 Kd2 Kg7 Ke3 Kh6 Kf4 Qh7 Qg5#

pure model ideal self-block

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

h#5.5

8/4Q3/6k1/8/8/3q4/q7/K7 w - - 0 1

  1. Kxa2 Qd4 Kb3 Qg7 Kc4 Kh7 Kd5 Kg8 Ke6 Qh8 Qf7#

pure model ideal self-block nocheck

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

Only 2 distinct ideas exist at this depth.

h#5

8/1k6/1Q6/8/8/2q5/4q3/1K6 b - - 0 1

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

  1. Ka8 Qb3 Qee3 Ka2 Ka7 Ka3 Ka6 Ka4 Qa7 Qb5#
  2. Kc8 Qa5 Qe7 Ka2 Qcf6 Kb3 Kd7 Kc4 Ke6 Qd5#

pure model ideal self-block nocapture nocheck

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

h#5

1Q5k/8/8/8/q2q4/8/8/1K6 b - - 0 1

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

  1. Kh7 Qb5 Qa6 Kc2 Qg7 Kd3 Qah6 Ke4 Kg6 Qf5#
  2. Qe8 Kc2 Qg7 Kd3 Qeg8 Ke4 Kh7 Kf5 Kh6 Qh2#

pure model ideal self-block nocapture nocheck

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