Helpmate tablebases Every solution to every position, precomputed.

← all materials

KQNvkn

5 pieces.

h#10
longest mate
h#8
deepest unique
16
positions at that depth
h#8
deepest dual
h#3.5
deepest strict dual
156,766,307
positions with a helpmate
13,867,473
with a unique solution
121,110,528
cells in the plane
107,424,821 bytes
on disk

Deepest unique problems

h#8

5n2/8/8/8/8/8/3Q2N1/K1k5 b - - 0 1

  1. Kxd2 Nh4 Ke3 Kb2 Kf4 Kc3 Kg5 Kd4 Kh6 Ke5 Kh7 Kf6 Kh8 Kf7 Nh7 Ng6#

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

2n5/8/8/3N4/6Qk/8/8/K7 b - - 0 1

  1. Kxg4 Kb2 Kf5 Kc3 Ke6 Kd4 Kd7 Ke5 Kc6 Ke6 Kb7 Kd7 Ka8 Kc7 Na7 Nb6#

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

5n2/8/8/8/1Q4N1/k7/8/1K6 b - - 0 1

  1. Kxb4 Kc2 Kc5 Kd3 Kd6 Ke4 Ke7 Kf5 Kf7 Ne5+ Kg8 Kf6 Kh8 Kf7 Nh7 Ng6#

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#3.5. The deepest dual overall is h#8, where the two solutions share a first or a last move.

h#3.5

8/8/8/6k1/1Q6/n7/1N6/1K6 w - - 0 1

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

  1. Kc1 Kf5 Nc4 Ke4 Nd6+ Kd3 Qd2#
  2. Qxa3 Kf4 Nd3+ Ke3 Nf4+ Kd2 Qc1#

single-piece single-piece:black umnov

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

h#3.5

8/8/7k/3Q4/8/3n4/8/N1K5 w - - 0 1

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

  1. Kd2 Ne5 Ke3 Kh5 Kf4 Kh4 Qh1#
  2. Qxd3 Kg5 Kd1 Kf4 Qf5+ Ke3 Nc2#

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

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