Helpmate tablebases Every solution to every position, precomputed.

← all materials

KRvkrn

5 pieces.

h#7.5
longest mate
h#6
deepest unique
22
positions at that depth
h#6
deepest dual
h#5.5
deepest strict dual
156,356,572
positions with a helpmate
6,231,712
with a unique solution
121,110,528
cells in the plane
61,485,360 bytes
on disk

Deepest unique problems

h#6

8/8/6k1/6R1/8/8/3r3n/K7 b - - 0 1

  1. Kh6 Kb1 Rd7 Kc2 Rh7 Kd3 Ng4 Ke4 Nf6+ Kf5 Nh5 Rg6#

self-block nocapture

Note: the side to move is in check in the diagram.

h#6

8/8/7k/8/8/7R/2r5/K2n4 b - - 0 1

  1. Kg5 Rb3 Kf4 Rb2 Ke3 Ka2 Kd2 Kb3 Kc1 Ra2 Rd2 Ra1#

self-block nocapture nocheck

Note: the side to move is in check in the diagram.

h#6

7R/7k/8/8/1rn5/8/8/K7 b - - 0 1

  1. Kg7 Ka2 Ra4+ Kb3 Ra8 Kxc4 Rg8 Kd5 Kf8 Ke6 Ke8 Rxg8#

pure model ideal mirror

Note: the side to move is in check in the diagram.

Deepest dual problems

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

h#5.5

8/8/6R1/7k/1r6/8/n7/K7 w - - 0 1

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

  1. Ra6 Kg4 Kxa2 Kf3 Ka3 Ke2 Kxb4 Kd1 Kc3 Kc1 Ra1#
  2. Rh6+ Kg4 Kxa2 Kf3 Ka3 Ke2 Kxb4 Kd1 Kc3 Kc1 Rh1#

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

h#5.5

4k3/8/8/8/5R2/8/3rn3/1K6 w - - 0 1

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

  1. Rf1 Nf4 Kc1 Kf7 Kxd2 Kg6 Ke3 Kh5 Kxf4 Kh4 Rh1#
  2. Rf2 Nf4 Kc1 Kf7 Kxd2 Kg6 Ke3 Kh5 Kxf4 Kh4 Rh2#

pure model ideal mirror nocheck umnov