Helpmate tablebases Every solution to every position, precomputed.

← all materials

KBvknn

5 pieces.

h#12.5
longest mate: h#9
deepest unique: 34
positions at that depth: h#9
deepest dual: h#6.5
deepest strict dual: 87,649,383
positions with a helpmate: 227,425
with a unique solution: 121,110,528
cells in the plane: 30,492,990 bytes
on disk

Deepest unique problems

h#9

8/8/8/8/8/8/5n2/kBK4n b - - 0 1

Nh3 Kd2 Kb2 Ke3 Kc1 Be4 Kd1 Bxh1 Ke1 Kf3 Kf1 Bg2+ Kg1 Bf1 Kh1 Kg3 Ng1 Bg2#

pure model ideal switchback self-block kniest umnov

h#9

8/8/1n6/8/2n5/8/8/kBK5 b - - 0 1

Nc8 Bd3 Ka2 Kc2 Ka3 Kc3 Ka4 Kxc4 Ka5 Kd5 Kb6 Ba6 Ka7 Kc6 Ka8 Kc7 Na7 Bb7#

pure model ideal self-block nocheck

h#9

n7/8/8/2n5/8/8/2K5/kB6 b - - 0 1

Na6 Kd3 Kb2 Kc4 Ka3 Be4 Ka4 Bxa8 Ka5 Bb7 Kb6 Bc8 Ka7 Kb5 Ka8 Kb6 Nb8 Bb7#

pure model ideal switchback self-block kniest nocheck

Deepest dual problems

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

h#6.5

6n1/8/7n/8/3k4/8/2K5/4B3 w - - 0 1

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

Kd2 Ke5 Ke3 Kf6 Kf4 Kg7 Kg5 Kh8 Kg6 Nf5 Bc3+ Ng7 Bxg7#
Bd2 Ke5 Kd3 Kf6 Ke4 Kg7 Bxh6+ Kh8 Kf5 Nf6 Kg6 Ng8 Bg7#

pure model ideal switchback self-block

h#6.5

8/8/8/2n5/3k1n2/8/3K4/7B w - - 0 1

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

Kd1 Ke3 Bg2 Kf2 Bf1 Kg1 Ke1 Kh1 Kf2 Nh3+ Kg3 Ng1 Bg2#
Bb7 Na6 Bc8 Kc5 Kc3 Kb6 Kc4 Ka7 Kb5 Ka8 Kb6 Nb8 Bb7#

pure model switchback self-block nocapture

h#6.5

8/6n1/7B/5n2/4k3/2K5/8/8 w - - 0 1

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

Bc1 Nh6 Bb2 Kf5 Kd4 Kg6 Ke5 Kh7 Kf6 Kh8 Kg6 Ng8 Bxg7#
Bxg7 Nh6 Bf8 Kf5 Kd4 Kg6 Ke5 Kh7 Kf6 Kh8 Kg6 Ng8 Bg7#

pure model ideal switchback self-block nocheck umnov