Helpmate tablebases Every solution to every position, precomputed.

← all materials

KNvkqn

5 pieces.

h#10.5
longest mate
h#8
deepest unique
2
positions at that depth
h#8.5
deepest dual
h#6.5
deepest strict dual
156,485,977
positions with a helpmate
650,179
with a unique solution
121,110,528
cells in the plane
87,583,732 bytes
on disk

Deepest unique problems

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

h#8

8/7k/8/8/8/N7/1nq5/K7 b - - 0 1

  1. Qa4 Kb1 Kg6 Kc1 Kf5 Kd2 Ke4 Ke1 Kd3 Nb5 Kc2 Ke2 Kb1 Kd2 Qa1 Nc3#

pure model ideal closed-walk self-block nocapture nocheck

Published as Sheglow (1998)

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

Deepest dual problems

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

h#6.5

8/8/5N2/4k3/3q4/2n5/8/K7 w - - 0 1

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

  1. Ng4+ Kd5 Kb2 Kc4 Kc1 Kb3 Ne3 Ka2 Kc2 Ka1 Kb3 Nb1 Nc2#
  2. Nd7+ Ke4 Kb2 Kd3 Ka3 Kc2 Nc5 Kb1 Kb3 Ka1 Kc2 Na2 Nb3#

pure model self-block nocapture

h#6.5

8/8/2q2n2/8/3k1N2/8/8/1K6 w - - 0 1

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

  1. Kb2 Kc5 Kc3 Kb6+ Kd4 Qc8 Ke5 Nd7+ Ke6 Kc7 Kf7 Kd8 Ne6#
  2. Ng2 Kc3 Kc1 Ne4 Kd1 Nd2 Ke2 Kc2 Ke3 Kd1 Kf2 Qc1 Ne3#

set-play pure model ideal self-block nocapture

h#6.5

8/8/3q4/8/nN2k3/8/8/1K6 w - - 0 1

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

  1. Nd5 Kd3 Kc1 Qa3+ Kd1 Nb2+ Ke1 Kc2 Ke2 Kb1 Kd2 Qa1 Nc3#
  2. Na6 Kd3 Ka2 Kc2 Nc5 Nc3+ Ka3 Kb1 Kb3 Ka1 Kc2 Na2 Nb3#

pure model ideal self-block nocapture