Helpmate tablebases Every solution to every position, precomputed.

← all materials

KRRvkb

5 pieces.

h#7
longest mate
h#5
deepest unique
290
positions at that depth
h#5
deepest dual
h#4
deepest strict dual
76,335,540
positions with a helpmate
7,703,911
with a unique solution
121,110,528
cells in the plane
49,638,991 bytes
on disk

Deepest unique problems

h#5

7b/6R1/8/8/8/8/6R1/K6k b - - 0 1

  1. Bxg7+ Rb2 Kg1 Kb1 Kf1 Kc2 Ke1 Kd3 Kd1 Rb1#

pure model mirror

Note: the solution begins with a capture.

h#5

8/8/8/8/6R1/7k/8/1K2b2R b - - 0 1

  1. Kxg4 Kc2 Bg3 Kd3 Bh2 Ke4 Kh4 Kf5 Kh5 Rxh2#

pure model ideal mirror nocheck

Note: the side to move is in check in the diagram; the solution begins with a capture.

Deepest dual problems

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

Only one position exists at this depth.