Helpmate tablebases Every solution to every position, precomputed.

← all materials

KNvkb

4 pieces.

h#10.5
longest mate: h#8
deepest unique: 5
positions at that depth: h#8
deepest dual: h#5.5
deepest strict dual: 3,046,415
positions with a helpmate: 8,859
with a unique solution: 1,892,352
cells in the plane: 1,262,647 bytes
on disk

Deepest unique problems

h#8

8/8/7k/8/8/1b6/4N3/K7 b - - 0 1

Kg5 Nd4 Kf4 Kb2 Ke3 Ka3 Kd2 Kb4 Kc1 Kc3 Kb1 Kd2 Ka1 Kc1 Ba2 Nc2#

pure model ideal self-block nocapture nocheck

h#8

2k5/8/8/8/3N4/8/7b/1K6 b - - 0 1

Kd7 Ne2 Ke6 Kc2 Kf5 Kd3 Kg4 Ke4 Kh3 Kf5 Kg2 Kg4 Kh1 Kh3 Bg1 Ng3#

pure model ideal self-block nocapture nocheck

h#8

3k4/8/8/8/8/8/5N1b/1K6 b - - 0 1

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

pure model ideal self-block nocapture

Deepest dual problems

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

Only 2 distinct ideas exist at this depth.

h#5.5

8/8/5N2/8/8/2k5/8/K6b w - - 0 1

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

Kb1 Be4+ Ka2 Kc2 Ka3 Kb1 Nd7 Ka1 Nc5 Bb1 Nb3#
Ka2 Bd5+ Kb1 Kb3 Kc1 Ka2 Ng4 Ka1 Ne3 Ba2 Nc2#

set-play pure model ideal self-block nocapture

h#5.5

8/8/8/8/3N4/3k4/8/K4b2 w - - 0 1

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

Kb1 Kc3 Kc1 Bc4 Kd1 Kb2 Kd2 Ka1 Kc1 Ba2 Nc2#
Ka2 Kc3 Ka3 Bd3 Ka4 Kb2 Kb4 Ka1 Ka3 Bb1 Nb3#

pure model ideal closed-walk self-block nocapture nocheck