Helpmate tablebases Every solution to every position, precomputed.

← all materials

KQRvkr

5 pieces.

h#7
longest mate
h#6
deepest unique
6
positions at that depth
h#6
deepest dual
h#3
deepest strict dual
134,690,835
positions with a helpmate
14,780,572
with a unique solution
121,110,528
cells in the plane
96,884,024 bytes
on disk

Deepest unique problems

h#6

8/8/7Q/7k/2R5/1r6/8/K7 b - - 0 1

  1. Kxh6 Ka2 Rb7 Ka3 Rf7 Kb4 Kg7 Kc5 Kf8 Kd6 Ke8 Rc8#

pure model ideal self-block nocheck

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

h#6

4kQ2/7R/8/8/8/8/6r1/1K6 b - - 0 1

  1. Kxf8 Kc1 Rg7 Kd2 Kf7 Ke3 Kg6 Rxg7+ Kh5 Kf4 Kh4 Rh7#

pure model ideal mirror switchback

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

h#6

8/8/7Q/7k/1r1R4/8/8/K7 b - - 0 1

  1. Kxh6 Ka2 Ra4+ Kb3 Ra7 Kc4 Kg7 Kd5 Kf8 Ke6 Rg7 Rd8#

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#3. The deepest dual overall is h#6, where the two solutions share a first or a last move.

h#3

8/8/8/8/8/3r4/4R3/K1kQ4 b - - 0 1

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

  1. Kxd1 Kb2 Rc3 Kxc3 Kc1 Re1#
  2. Rxd1 Ka2 Re1 Kb3 Kb1 Rxe1#

pure model ideal mirror switchback nocheck

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

h#3

8/8/8/8/8/4r3/5R2/1K1kQ3 b - - 0 1

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

  1. Kxe1 Kc2 Rd3 Kxd3 Kd1 Rf1#
  2. Rxe1 Kb2 Rf1 Kc3 Kc1 Rxf1#

pure model ideal mirror switchback nocheck

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