Helpmate tablebases Every solution to every position, precomputed.

← all materials

KRBvkq

5 pieces.

h#7.5
longest mate
h#6.5
deepest unique
3
positions at that depth
h#5.5
deepest dual
h#4.5
deepest strict dual
139,084,818
positions with a helpmate
10,413,426
with a unique solution
121,110,528
cells in the plane
103,280,917 bytes
on disk

Deepest unique problems

Deepest dual problems

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

h#4.5

8/8/8/7k/8/8/R1B5/Kq6 w - - 0 1

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

  1. Kxb1 Kg4 Kb2 Kf3 Kc3 Ke2 Bd3+ Kd1 Ra1#
  2. Bxb1 Kg4 Kb2 Kf3 Ra1 Ke2 Kc3 Kd1 Bd3#

mirror single-piece single-piece:black

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

h#4.5

8/8/3k4/8/2R5/7B/2q5/2K5 w - - 0 1

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

  1. Kxc2 Kd5 Rh4 Kc5 Bg4 Kb4 Bd7+ Ka3 Ra4#
  2. Rxc2 Kd5 Rd2+ Kc4 Rd5 Kb3 Be6 Ka2 Ra5#

pure model ideal mirror single-piece single-piece:black umnov

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

h#4.5

4kB2/8/8/8/8/2R5/2q5/2K5 w - - 0 1

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

  1. Kxc2 Kxf8 Kd3 Kg7 Ke4 Kh6 Kf5 Kh5 Rh3#
  2. Rxc2 Kf7 Kd2 Kg6 Ke3 Kh5 Kf4 Kh4 Rh2#

pure model ideal mirror single-piece single-piece:black nocheck

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