Helpmate tablebases Every solution to every position, precomputed.

← all materials

KNPvkb

5 pieces.

h#11
longest mate
h#7.5
deepest unique
4
positions at that depth
h#7.5
deepest dual
h#7
deepest strict dual
542,129,015
positions with a helpmate
11,935,803
with a unique solution
355,074,048
cells in the plane
344,826,897 bytes
on disk

Deepest unique problems

Only 2 distinct ideas exist at this depth.

Deepest dual problems

Deepest dual with different first and last moves: h#7. The deepest dual overall is h#7.5, where the two solutions share a first or a last move.

h#7

8/8/8/3b3k/8/K7/P6N/8 b - - 0 1

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

  1. Bh1 Kb3 Kg5 a4 Kf4 a5 Ke3 a6 Kd2 a7 Kc1 a8=Q Kb1 Qxh1#
  2. Bb3 Kxb3 Kg5 a4 Kf4 a5 Ke3 a6 Kd2 a7 Kc1 a8=Q Kb1 Qh1#

pure mirror promotion excelsior excelsior:white nocheck

h#7

8/8/7k/3b4/8/K7/P7/N7 b - - 0 1

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

  1. Bh1 Kb3 Kg5 a4 Kf4 a5 Ke3 a6 Kd2 a7 Kc1 a8=Q Kb1 Qxh1#
  2. Bb3 Kxb3 Kg5 a4 Kf4 a5 Ke3 a6 Kd2 a7 Kc1 a8=Q Kb1 Qh1#

promotion excelsior excelsior:white nocheck