Helpmate tablebases Every solution to every position, precomputed.

← all materials

KBPvkp

5 pieces.

h#16
longest mate
h#10.5
deepest unique
1
positions at that depth
h#11
deepest dual
h#9
deepest strict dual
417,334,244
positions with a helpmate
11,158,295
with a unique solution
266,305,536
cells in the plane
296,394,196 bytes
on disk

Deepest unique problems

Only one position exists at this depth.

h#10.5

5B2/8/8/7p/7P/1k6/8/1K6 w - - 0 1

  1. Kc1 Kc4 Kd2 Kd5 Ke3 Ke6 Kf4 Kf7 Kg5 Kg8 Kxh5 Kh8 Kg6 Kg8 h5 Kh8 h6 Kg8 h7+ Kh8 Bg7#

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

Published as Szentai (1958)

  • Szentai, Endre — Magyar Sakkelet, 1958; Suomen Tehtäväniekat, No. 320, 18/10/1999; Ideal-Mate Encyclopedia Vol.1, No. 1304, 1999

Deepest dual problems

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

Only one distinct idea exists at this depth: 2 positions share a solution.

h#9

2B5/8/8/p7/P4k2/8/K7/8 b - - 0 1

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

  1. Ke4 Kb3 Ke5 Kc4 Kd6 Kb5 Kc7 Kxa5 Kb8 Kb6 Ka8 a5 Kb8 a6 Ka8 Bb7+ Kb8 a7#
  2. Ke5 Kb3 Kd6 Kc4 Kc7 Kb5 Kb8 Kxa5 Ka8 Kb6 Kb8 a5 Ka8 a6 Kb8 a7+ Ka8 Bb7#

set-play pure model ideal switchback single-piece single-piece:black