Helpmate tablebases Every solution to every position, precomputed.

← all materials

KBBBvk

5 pieces.

h#8
longest mate
h#7
deepest unique
3
positions at that depth
h#7
deepest dual
h#5
deepest strict dual
21,024,540
positions with a helpmate
1,742,417
with a unique solution
121,110,528
cells in the plane
18,754,392 bytes
on disk

Deepest unique problems

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

Deepest dual problems

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

Only one position exists at this depth.