Helpmate tablebases Every solution to every position, precomputed.

← all materials

KBvkbn

5 pieces.

h#12
longest mate: h#9
deepest unique: 57
positions at that depth: h#9
deepest dual: h#7
deepest strict dual: 170,893,115
positions with a helpmate: 646,139
with a unique solution: 121,110,528
cells in the plane: 52,578,662 bytes
on disk

Deepest unique problems

h#9

8/8/1n6/3b4/8/8/8/KBk5 b - - 0 1

Kd2 Bd3 Kc3 Ba6 Kb4 Kb2 Ka5 Kc3 Nc8 Kd4 Kb6 Kxd5 Ka7 Kc6 Ka8 Kc7 Na7 Bb7#

pure model ideal self-block nocheck

h#9

8/8/8/8/8/8/5n2/kBK4b 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/8/8/5nb1/3B4/k1K5/8 b - - 0 1

Nh3 Kd2 Kb2 Ke3 Kc1 Bf5 Kd1 Bxg4+ Ke1 Kf3 Kf1 Kg3 Kg1 Be2 Kh1 Bf1 Ng1 Bg2#

pure model ideal self-block

Deepest dual problems

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

Only one distinct idea exists at this depth: 2 positions share a solution.

h#7

8/8/8/6B1/4n1b1/6k1/8/2K5 b - - 0 1

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

Nf6 Bh6 Kh4 Kd2 Kh5 Ke3 Kg6 Kf4 Kh7 Kg5 Kh8 Kg6 Ng8 Bg7#
Be6 Kc2 Kg4 Kd3 Kh5 Kxe4 Kg6 Ke5 Kh7 Kf6 Kh8 Kg6 Bg8 Bf6#

pure model self-block nocheck