Helpmate tablebases Every solution to every position, precomputed.

← all materials

KBNNvk

5 pieces.

h#8
longest mate: h#6.5
deepest unique: 8
positions at that depth: h#7
deepest dual: h#5
deepest strict dual: 88,746,414
positions with a helpmate: 3,299,675
with a unique solution: 121,110,528
cells in the plane: 76,621,068 bytes
on disk

Deepest unique problems

h#6.5

7k/8/8/8/8/7N/2B3N1/K7 w - - 0 1

Kb2 Kg8 Kc3 Kg7 Kd4 Kh6 Ke5 Kh5 Kf6 Kg4 Kg7 Kh5 Bd1#

pure model ideal mirror switchback single-piece single-piece:black nocapture nocheck

Published as Sheglow (1998)

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

h#6.5

4N2k/8/8/7B/8/5N2/8/K7 w - - 0 1

Kb2 Kg8 Kc3 Kh7 Kd4 Kh6 Ke5 Kxh5 Kf6 Kg4 Kg7 Kh5 Nf6#

pure model ideal mirror switchback single-piece single-piece:black kniest nocheck

h#6.5

7k/6NB/1N6/8/8/8/8/K7 w - - 0 1

Bg6 Kg8 Kb2 Kf8 Kc3 Ke7 Kd4 Kd8 Ke5 Kc7 Kf6 Kd8 Ne6#

pure model ideal mirror switchback single-piece single-piece:black nocapture nocheck

Deepest dual problems

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

h#5

3N3N/8/8/8/3B4/8/8/K1k5 b - - 0 1

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

Kc2 Nc6 Kb3 Kb1 Ka4 Kc2 Ka3 Bb2+ Ka2 Nb4#
Kd2 Kb2 Kd1 Kc3 Kc1 Nc6 Kb1 Nb4 Ka1 Kc2#

pure mirror closed-walk single-piece single-piece:black nocapture

h#5

B7/8/8/8/8/8/7N/2K3Nk b - - 0 1

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

Kxg1 Kd2 Kf2 Ng4+ Kf1 Ke3 Kg1 Kf3 Kh1 Kf2#
Kxh2 Kd2 Kg3 Ne2+ Kh3 Ke3 Kh2 Kf3 Kh1 Kg3#

mirror closed-walk single-piece single-piece:black

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

h#5

5N2/8/8/8/7N/8/8/k1BK4 b - - 0 1

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

Kb1 Nf3 Ka2 Kc2 Ka1 Kb3 Kb1 Nd2+ Ka1 Bb2#
Ka2 Kc2 Ka1 Kb3 Kb1 Nf3 Ka1 Bb2+ Kb1 Nd2#

set-play pure switchback closed-walk single-piece single-piece:black nocapture