Helpmate tablebases Every solution to every position, precomputed.

← all materials

KNvkbn

5 pieces.

h#10
longest mate
h#8
deepest unique
5
positions at that depth
h#8
deepest dual
h#7
deepest strict dual
175,860,097
positions with a helpmate
847,095
with a unique solution
121,110,528
cells in the plane
73,637,031 bytes
on disk

Deepest unique problems

Deepest dual problems

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

h#7

8/8/5k2/8/8/5N2/1n6/K4b2 b - - 0 1

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

  1. Bd3 Nd2 Ke5 Kxb2 Kd4 Ka3 Kc3 Ka4 Kb2 Kb4 Ka1 Ka3 Bb1 Nb3#
  2. Bc4 Ne1 Ke5 Kxb2 Kd4 Kc1 Kc3 Kd1 Kb2 Kd2 Ka1 Kc1 Ba2 Nc2#

pure model ideal closed-walk self-block nocheck

h#7

8/8/5k2/8/8/5N2/4b3/K2n4 b - - 0 1

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

  1. Bd3 Nd2 Ke5 Ka2 Kd4 Ka3 Kc3 Ka4 Kb2 Kb4 Ka1 Ka3 Bb1 Nb3#
  2. Bc4 Ne1 Ke5 Kb1 Kd4 Kc1 Kc3 Kxd1 Kb2 Kd2 Ka1 Kc1 Ba2 Nc2#

pure model ideal closed-walk self-block nocheck

h#7

8/8/5k2/8/n7/5N1b/8/K7 b - - 0 1

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

  1. Bf5 Nd2 Ke5 Ka2 Kd4 Ka3 Kc3 Kxa4 Kb2 Kb4 Ka1 Ka3 Bb1 Nb3#
  2. Be6 Ne1 Ke5 Kb1 Kd4 Kc1 Kc3 Kd1 Kb2 Kd2 Ka1 Kc1 Ba2 Nc2#

pure model ideal closed-walk self-block nocheck