Helpmate tablebases Every solution to every position, precomputed.

← all materials

KQNvkb

5 pieces.

h#11
longest mate
h#8
deepest unique
5
positions at that depth
h#8
deepest dual
h#5
deepest strict dual
151,800,948
positions with a helpmate
14,050,333
with a unique solution
121,110,528
cells in the plane
118,392,452 bytes
on disk

Deepest unique problems

h#8

8/8/8/6Qk/8/1b6/4N3/K7 b - - 0 1

  1. Kxg5 Nd4 Kf4 Kb2 Ke3 Ka3 Kd2 Kb4 Kc1 Kc3 Kb1 Kd2 Ka1 Kc1 Ba2 Nc2#

pure model ideal self-block nocheck

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

h#8

3k4/3Q4/8/8/3N4/8/7b/1K6 b - - 0 1

  1. Kxd7 Ne2 Ke6 Kc2 Kf5 Kd3 Kg4 Ke4 Kh3 Kf5 Kg2 Kg4 Kh1 Kh3 Bg1 Ng3#

pure model ideal self-block nocheck

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

h#8

4k3/4Q3/8/8/8/8/5N1b/1K6 b - - 0 1

  1. Kxe7 Kc2 Kf6 Kd3 Kg5 Ke4 Kh4 Kf5 Kg3 Ne4+ Kg2 Kg4 Kh1 Kh3 Bg1 Ng3#

pure model ideal self-block

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

Only one position exists at this depth.

h#5

8/8/8/8/2Q5/3k4/bK6/5N2 b - - 0 1

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

  1. Kxc4 Ka3 Kc3 Ka4 Kb2 Nd2 Ka1 Ka3 Bb1 Nb3#
  2. Bxc4 Kc1 Kc3 Kd1 Kb2 Ne3 Ka1 Kc1 Ba2 Nc2#

pure model ideal switchback self-block nocheck

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