Helpmate tablebases Every solution to every position, precomputed.

← all materials

KNvkrn

5 pieces.

h#10.5
longest mate: h#8.5
deepest unique: 1
positions at that depth: h#8
deepest dual: h#6.5
deepest strict dual: 168,852,880
positions with a helpmate: 1,172,374
with a unique solution: 121,110,528
cells in the plane: 74,630,646 bytes
on disk

Deepest unique problems

Only one position exists at this depth.

h#8.5

6k1/8/8/8/8/n7/4r3/1KN5 w - - 0 1

Ka1 Kf7 Nxe2 Ke6 Kb2 Kd5 Kc1 Kc4 Kd2 Kb3 Nd4+ Ka2 Kc3 Ka1 Kb3 Nb1 Nc2#

pure model ideal self-block

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

Deepest dual problems

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

h#6.5

8/8/8/4k3/8/4r3/n1N5/K7 w - - 0 1

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

Kb1 Ke4 Kb2 Kd3 Ka3 Kc3 Ka4 Kb2 Ka5 Rb3 Ne3 Ka3 Nc4#
Kxa2 Re1 Ne3 Kd4 Ka3 Kc3 Ka4 Kb2 Kb4 Ka1 Ka3 Rb1 Nc2#

set-play pure model ideal switchback closed-walk self-block nocheck umnov

h#6.5

8/8/1N6/5k2/2r5/8/8/1Kn5 w - - 0 1

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

Nd5 Rh4 Kc2 Kg4 Kd2 Rh2+ Ke3 Kh3 Kf4 Ne2+ Kg5 Ng3 Nf4#
Nxc4 Ke4 Kc2 Kd4 Kd1 Kc3 Na5 Kb2 Kd2 Ka1 Kc2 Na2 Nb3#

pure model ideal closed-walk self-block

h#6.5

8/8/4k3/8/8/5n2/r2N4/1K6 w - - 0 1

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

Kc1 Kf5 Kd1 Kg4 Ke2 Kh3 Kf2 Kh2 Kf1 Kh1 Ne4 Rh2 Ng3#
Nc4 Kd5 Nb2 Kc5 Kc2 Kb4 Kd3 Ka3 Kc4 Nd2+ Kb5 Nb3 Nc4#

set-play pure model ideal switchback self-block nocapture