Helpmate tablebases Every solution to every position, precomputed.

← all materials

KQvknn

5 pieces.

h#7
longest mate
h#6
deepest unique
9
positions at that depth
h#6
deepest dual
h#5
deepest strict dual
76,677,832
positions with a helpmate
3,761,728
with a unique solution
121,110,528
cells in the plane
41,925,443 bytes
on disk

Deepest unique problems

h#6

7k/8/8/8/8/8/8/K1nn3Q b - - 0 1

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

mirror nocheck

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

h#6

7k/8/8/8/8/3n4/7Q/K1n5 b - - 0 1

  1. Kg7 Kb1 Ne2 Kc2 Ng1 Kxd3 Nh3 Ke4 Kh6 Kf5 Kh5 Qxh3#

mirror nocheck

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

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/8/4k3/2nQ4/8/8/K1n5 b - - 0 1

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

  1. Kf5 Qf6+ Ke4 Kb1 Ke3 Kc2 Ke2 Kc3 Kd1 Qf1#
  2. Ke6 Qxc4+ Kd6 Qe6+ Kc5 Kb2 Kb5 Kc3 Ka4 Qa6#

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

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

h#5

8/8/8/4k3/3Q4/2n5/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/4k3/3Q4/8/2n5/8/n7/1K6 b - - 0 1

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

  1. Kf7 Kc2 Kg7 Kd3 Ne5+ Ke4 Ng6 Kf5 Kh6 Qxg6#
  2. Ke8 Qf8+ Kd7 Kxa2 Kc6 Kb3 Kb5 Kc3 Ka4 Qb4#

single-piece single-piece:black

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