Helpmate tablebases Every solution to every position, precomputed.

← all materials

KQvkqb

5 pieces.

h#7.5
longest mate
h#5.5
deepest unique
25
positions at that depth
h#6
deepest dual
h#5
deepest strict dual
126,079,157
positions with a helpmate
5,594,641
with a unique solution
121,110,528
cells in the plane
94,942,033 bytes
on disk

Deepest unique problems

h#5.5

8/8/5k2/8/6Q1/q7/8/Kb6 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/7k/8/8/8/6Q1/q6b/K7 w - - 0 1

  1. Kxa2 Bg1 Kb3 Bd4 Kc4 Bg7 Kd5 Kg8 Ke6 Kf8 Qb8#

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

h#5

8/8/7k/1q6/8/8/8/K1Q4b b - - 0 1

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

  1. Kh5 Qb2 Kg4 Kb1 Kf3 Kc2 Ke2 Kc3+ Kd1 Qd2#
  2. Qg5 Qe1 Qg4 Kb2 Kg5 Kc3 Kf4 Kd4 Bf3 Qe5#

self-block single-piece single-piece:black nocapture

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

h#5

8/8/7k/2b5/1q2Q3/8/8/K7 b - - 0 1

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

  1. Qe1+ Kb2 Qh4 Kc3 Bf8 Kd4 Kg5 Ke5 Bh6 Qf5#
  2. Bd4+ Ka2 Qf8 Kb3 Kg7 Kc4 Kf7 Kd5 Bg7 Qe6#

pure model ideal self-block nocapture

h#5

8/7k/8/8/8/q7/2Q4b/1K6 b - - 0 1

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

  1. Kg7 Qh7+ Kf6 Kc2 Qe7 Kd3 Ke6 Ke4 Bd6 Qf5#
  2. Qd3 Kc1 Qg6 Kd2 Kh6 Ke3 Bf4+ Kxf4 Kh5 Qh2#

pure model ideal self-block umnov

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