Helpmate tablebases Every solution to every position, precomputed.

← all materials

KQvkbp

5 pieces.

h#7
longest mate
h#5.5
deepest unique
2
positions at that depth
h#6
deepest dual
h#5
deepest strict dual
461,990,201
positions with a helpmate
22,731,167
with a unique solution
355,074,048
cells in the plane
291,295,657 bytes
on disk

Deepest unique problems

Only one distinct idea exists at this depth: 2 positions share a solution.

h#5.5

6Q1/8/7k/8/3b4/8/p7/K7 w - - 0 1

  1. Kxa2 Kh5 Kb1 Kh4 Qa2 Kg3 Kc2 Kf2 Kd3+ Ke1 Qe2#

single-piece single-piece:black

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#6, where the two solutions share a first or a last move.

h#5

8/3k4/2Q5/8/b7/p7/8/1K6 b - - 0 1

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

  1. Ke7 Qh1 Kd6 Kc1 Kc5 Kd2 Kb4 Kd3 Kb3 Qb1#
  2. Kd8 Qe8+ Kc7 Ka2 Bb3+ Kxb3 Kb6 Kc4 Ka5 Qb5#

single-piece single-piece:black

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

h#5

4k3/1Q6/8/8/p7/1b6/8/1K6 b - - 0 1

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

  1. Bf7 Kc2 Kf8 Kd3 Kg7 Ke4 Kh6 Kf5 Kh5 Qh1#
  2. a3 Qxb3 Kd7 Kc2 Kc6 Qe6+ Kb5 Kc3 Ka4 Qa6#

pure model mirror

h#5

5k2/7Q/8/8/3p4/1b6/8/1K6 b - - 0 1

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

  1. Ke8 Kb2 Kd8 Qb1 Kc7 Kxb3 Kb6 Kc4+ Ka5 Qb5#
  2. Bd5 Qf5+ Ke7 Kb2 Kd6 Ka3 Kc5 Ka4 Kc4 Qc2#

self-block single-piece single-piece:black