Helpmate tablebases Every solution to every position, precomputed.

← all materials

KRBvkn

5 pieces.

h#12
longest mate
h#8
deepest unique
4
positions at that depth
h#7
deepest dual
h#5.5
deepest strict dual
165,092,072
positions with a helpmate
12,161,108
with a unique solution
121,110,528
cells in the plane
91,170,407 bytes
on disk

Deepest unique problems

h#8

8/8/7n/8/8/8/1K1R1B2/3k4 b - - 0 1

  1. Kxd2 Bc5 Kd3 Bf8 Ke4 Kc3 Kf5 Kd4 Kg6 Ke5 Kh7 Kf6 Kh8 Kg6 Ng8 Bg7#

pure model ideal self-block nocheck

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

h#8

5n2/8/8/8/8/6B1/1K1R4/3k4 b - - 0 1

  1. Kxd2 Bf4+ Kd3 Bh6 Ke4 Kc3 Kf5 Kd4 Kg6 Ke5 Kh7 Kf6 Kh8 Kf7 Nh7 Bg7#

pure model ideal self-block

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

h#8

5n2/8/8/8/8/8/1K1R1B2/3k4 b - - 0 1

  1. Kxd2 Be3+ Kd3 Bh6 Ke4 Kc3 Kf5 Kd4 Kg6 Ke5 Kh7 Kf6 Kh8 Kf7 Nh7 Bg7#

pure model ideal self-block

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#5.5. The deepest dual overall is h#7, 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#5.5

8/8/7k/8/6R1/8/1n6/K6B w - - 0 1

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

  1. Ra4 Kg5 Be4 Kf4 Kxb2 Ke3 Kc3 Ke2 Bd3+ Kd1 Ra1#
  2. Rb4 Kg5 Be4 Kf4 Kxb2 Ke3 Kc3 Ke2 Bd3+ Kd1 Rb1#

mirror single-piece single-piece:black