Helpmate tablebases Every solution to every position, precomputed.

← all materials

KRvkbn

5 pieces.

h#7
longest mate
h#6
deepest unique
12
positions at that depth
h#6
deepest dual
h#5.5
deepest strict dual
163,332,648
positions with a helpmate
6,735,121
with a unique solution
121,110,528
cells in the plane
74,243,651 bytes
on disk

Deepest unique problems

h#6

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

  1. Kg5 Rc2 Kf4 Rxc4+ Ke3 Ka2 Kd2 Rd4+ Kc1 Kb3 Kb1 Rxd1#

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

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

Published as Sheglow (1998)

  • Sheglow, Wiktor S. — Suomen Tehtäväniekat, No. (306), 05-06/1998

h#6

7R/8/7k/8/8/8/3n4/K1b5 b - - 0 1

  1. Kg7 Ka2 Ne4 Kb3 Nf6 Kc4 Ng8 Kd5 Kf8 Ke6 Ke8 Rxg8#

pure model mirror nocheck

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

h#6

7k/8/8/8/8/b7/7R/K1n5 b - - 0 1

  1. Kg7 Kb1 Ne2 Kc2 Ng1 Kd3 Nh3 Ke4 Kh6 Kf5 Kh5 Rxh3#

pure model mirror nocheck

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/7R/5k2/2n5/8/b7/8/K7 w - - 0 1

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

  1. Kb1 Bc1 Kc2 Bh6 Kd1 Kg5 Ke2 Kh4 Kf3 Kh3 Rxh6#
  2. Ka2 Ne6 Kxa3 Ng7 Kb4 Ke7 Kc5 Kd8 Kd6 Nh5 Rh8#

pure model mirror nocheck

h#5.5

4k3/8/5R2/8/1n6/2b5/8/1K6 w - - 0 1

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

  1. Rf1 Bf6 Kc1 Kf7 Kd2 Kg6 Ke3 Kh5 Kf4 Kh4 Rh1#
  2. Rf2 Bf6 Kc1 Kf7 Kd2 Kg6 Ke3 Kh5 Kf4 Kh4 Rh2#

pure model mirror nocapture nocheck umnov

h#5.5

4k3/6R1/5b2/8/1n6/8/8/1K6 w - - 0 1

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

  1. Rg1 Kf7 Kc1 Bg5+ Kd1 Kg6 Ke2 Kh5 Kf3 Kh4 Rh1#
  2. Rg2 Kf7 Kc1 Bg5+ Kd1 Kg6 Ke2 Kh5 Kf3 Kh4 Rh2#

pure model self-block nocapture