Helpmate tablebases Every solution to every position, precomputed.

← all materials

KPPvkn

5 pieces.

h#8.5
longest mate
h#7.5
deepest unique
1
positions at that depth
h#7
deepest dual
h#6.5
deepest strict dual
213,767,174
positions with a helpmate
4,307,579
with a unique solution
266,305,536
cells in the plane
109,472,804 bytes
on disk

Deepest unique problems

Only one position exists at this depth.

h#7.5

1K6/8/n7/8/8/P7/P7/7k w - - 0 1

  1. Kc8 Nb4 axb4 Kg2 a4 Kf3 a5 Ke4 a6 Kd5 a7 Kc6 a8=Q+ Kb6 Qb7#

promotion excelsior excelsior:white

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#7, where the two solutions share a first or a last move.

h#6.5

8/5k2/8/8/8/n2P4/2KP4/8 w - - 0 1

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

  1. Kb3 Nc4 d4 Ne5 dxe5 Kg6 e6 Kf5 e7 Ke4 e8=Q+ Kd3 Qe3#
  2. Kc3 Nc4 dxc4 Ke6 c5 Kd5 c6 Kc5 c7 Kb5 c8=Q Ka4 Qa6#

pure model mirror promotion umnov

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

h#6.5

6k1/8/8/8/3n4/2P5/2K3P1/8 w - - 0 1

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

  1. Kb1 Kf7 g4 Ke6 g5 Kd5 g6 Kc4 g7 Kb3 g8=Q+ Ka3 Qa2#
  2. cxd4 Kf7 g4 Ke6 g5 Kd5 g6 Kc4 g7 Kb4 g8=Q Ka3 Qb3#

promotion excelsior excelsior:white single-piece single-piece:black

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

h#6.5

6k1/8/8/8/3n4/4P1P1/2K5/8 w - - 0 1

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

  1. Kc1 Kf7 e4 Ke6 e5 Kd5 e6 Kc4 e7 Kb3 e8=Q Ka2 Qa4#
  2. exd4 Kf7 g4 Ke6 g5 Kd5 g6 Kc4 g7 Kb4 g8=Q Ka3 Qb3#

pure model mirror promotion single-piece single-piece:black nocheck umnov

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