Helpmate tablebases Every solution to every position, precomputed.

← all materials

KRNvkb

5 pieces.

h#10
longest mate
h#6
deepest unique
33
positions at that depth
h#8
deepest dual
h#4.5
deepest strict dual
163,969,432
positions with a helpmate
12,061,552
with a unique solution
121,110,528
cells in the plane
117,025,247 bytes
on disk

Deepest unique problems

h#6

8/8/8/8/8/4N3/4R3/Kb2k3 b - - 0 1

  1. Kxe2 Kb2 Kd3 Kc1 Kc3 Kd1 Kb2 Kd2 Ka1 Kc1 Ba2 Nc2#

pure model ideal closed-walk self-block nocheck

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

h#6

8/8/8/8/8/1b6/8/1K1kRN2 b - - 0 1

  1. Kxe1 Kb2 Kd1 Kc3 Kc1 Ne3 Kb1 Kd2 Ka1 Kc1 Ba2 Nc2#

pure model ideal switchback self-block nocheck

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

h#6

8/8/8/kRN5/8/8/b7/2K5 b - - 0 1

  1. Kxb5 Kb2 Kc4 Ka3 Kc3 Ka4 Kb2 Kb4 Ka1 Ka3 Bb1 Nb3#

pure model ideal closed-walk self-block nocheck

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

h#4.5

8/8/5k2/6R1/7b/8/8/N1K5 w - - 0 1

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

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

pure self-block nocapture umnov

h#4.5

7R/8/5k2/4b3/8/8/1K6/N7 w - - 0 1

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

  1. Kc1 Kf5 Nb3 Ke4 Rh4+ Kd3 Re4 Bc3 Nc5#
  2. Ka3 Ke6 Nc2 Kd5 Rd8+ Kc4 Rd5 Bc3 Ne3#

pure model ideal self-block nocapture umnov

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