Helpmate tablebases Every solution to every position, precomputed.

← all materials

KRvknp

5 pieces.

h#7
longest mate: h#6
deepest unique: 1,731
positions at that depth: h#6
deepest dual: h#5.5
deepest strict dual: 519,354,520
positions with a helpmate: 25,900,281
with a unique solution: 355,074,048
cells in the plane: 192,693,705 bytes
on disk

Deepest unique problems

h#6

8/8/6k1/5R2/p7/8/8/K1n5 b - - 0 1

Kh7 Kb2 a3+ Kc3 a2 Kd4 a1=R Ke5 Ra8 Kf6 Rg8 Rh5#

pure model promotion underpromotion self-block nocapture

h#6

8/8/7k/6p1/6R1/n7/8/K7 b - - 0 1

Kh5 Rxg5+ Kh4 Rh5+ Kg3 Kb2 Kf2 Kc3 Ke1 Kd3 Kd1 Rh1#

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

h#6

8/4Rk2/8/8/2n5/8/2p5/K7 b - - 0 1

Kf8 Ka2 Nd6 Kb3 Ne8 Kc4 c1=R+ Kd5 Rg1 Ke6 Rg8 Rf7#

promotion underpromotion self-block nocapture

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

Chosen from the first 500 of 1,731 positions at this depth.

Deepest dual problems

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

h#5.5

7R/6k1/8/8/8/8/4p3/K2n4 w - - 0 1

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

Kb1 e1=R Kc2 Rh1 Kd3 Rh7 Ke4 Kh6 Kf5 Kh5 Rxh7#
Ka2 e1=R Kb3 Re8 Kc4 Rg8 Kd5 Kf8 Ke6 Ke8 Rxg8#

pure model mirror promotion underpromotion nocheck

h#5.5

7R/6k1/8/8/n7/8/3p4/K7 w - - 0 1

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

Kb1 d1=R+ Kc2 Rh1 Kd3 Rh7 Ke4 Kh6 Kf5 Kh5 Rxh7#
Ka2 d1=R Kb3 Rd8 Kc4 Rg8 Kd5 Kf8 Ke6 Ke8 Rxg8#

pure model mirror promotion underpromotion

h#5.5

7R/6k1/8/8/8/3n4/4p3/K7 w - - 0 1

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

Kb1 e1=R+ Kc2 Rh1 Kxd3 Rh7 Ke4 Kh6 Kf5 Kh5 Rxh7#
Ka2 e1=R Kb3 Re8 Kc4 Rg8 Kd5 Kf8 Ke6 Ke8 Rxg8#

pure model ideal mirror promotion underpromotion