Helpmate tablebases Every solution to every position, precomputed.

← all materials

KQvkrn

5 pieces.

h#6.5
longest mate
h#5.5
deepest unique
2
positions at that depth
h#5.5
deepest dual
h#5
deepest strict dual
142,123,767
positions with a helpmate
6,259,556
with a unique solution
121,110,528
cells in the plane
70,346,905 bytes
on disk

Deepest unique problems

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

h#5.5

8/6k1/8/8/8/8/8/Krn4Q w - - 0 1

  1. Kxb1 Ne2 Kc2 Ng1 Kd3 Nh3 Ke4 Kh6 Kf5 Kh5 Qxh3#

mirror 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.

h#5

8/8/8/4k3/3Q4/2r5/8/K2n4 b - - 0 1

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

  1. Kf5 Qxc3 Ke4 Qe1+ Kd3 Ka2 Kc2 Ka3 Kb1 Qxd1#
  2. Ke6 Qxc3 Kd5 Qe5+ Kc4 Kb1 Kb4 Kc2 Ka3 Qa5#

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

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

h#5

8/8/8/4k3/3Q4/2rn4/8/K7 b - - 0 1

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

  1. Kf5 Qxd3+ Kf4 Qf5+ Ke3 Kb2 Ke2 Kxc3 Kd1 Qf1#
  2. Ke6 Qxc3 Kd5 Qe5+ Kc4 Kb1 Kb4 Kc2 Ka3 Qa5#

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

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

h#5

8/6Q1/5k2/8/8/2r5/8/K2n4 b - - 0 1

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

  1. Kf5 Qxc3 Ke4 Qe1+ Kd3 Ka2 Kc2 Ka3 Kb1 Qxd1#
  2. Ke6 Qxc3 Kd5 Qe5+ Kc4 Kb1 Kb4 Kc2 Ka3 Qa5#

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

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