Helpmate tablebases Every solution to every position, precomputed.

← all materials

KNNvknn

6 pieces.

h#8
longest mate
h#6.5
deepest unique
31
positions at that depth
h#6.5
deepest dual
h#5.5
deepest strict dual
2,544,223,535
positions with a helpmate
35,287,772
with a unique solution
7,751,073,792
cells in the plane
1,622,099,336 bytes
on disk

Deepest unique problems

h#6.5

7k/8/8/8/8/2n5/8/NKnN4 w - - 0 1

  1. Kb2 Kg7 Ka3 Kf6 Kb4 Ke5 Kc5 Nb3+ Kc6 Kd4 Nc2+ Kc4 Nb2#

pure model ideal self-block nocapture

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

Deepest dual problems

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

h#5.5

4N3/3n4/8/4k3/8/8/1n6/K6N w - - 0 1

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

  1. Nf2 Nd3 Ng4+ Ke4 Ka2 N7e5 Kb3 Nf3 Kc4 Nf4 Nd6#
  2. Nf6 Nd3 Ng4+ Ke4 Ka2 N7e5 Kb3 Nf3 Kc4 Nf4 Ng3#

pure model ideal self-block nocapture

h#5.5

8/7N/7k/8/1n6/n7/8/1K5N w - - 0 1

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

  1. Kc1 Kh5 Ng3+ Kg4 Nf6+ Kf3 Nd5 Kf2 Nxb4 Ke1 Nd3#
  2. Kb2 Kh5 Ng3+ Kg4 Ne4 Kf3 Nhg5+ Ke2 Nf3 Kd1 Nc3#

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

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

h#5.5

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

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

  1. Kc2 Kg5 Nc4 Kf4 Ne5 Ke3 Kd1 Nf4 Ke1 Ne4 Nc2#
  2. Kxd2 Kg5 Ke2 Kf4 Kf1 Ke3 N3c2+ Kd2 Nb3+ Kd1 Ne3#

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

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