h#9.5
8/6p1/1K2k1p1/8/8/8/8/2N5 w - - 0 1
- Kc7 g5 Kd8 g4 Ke8 g3 Kf8 g2 Kxg7 g1=R+ Kh7 Kf7 Kh6 Kg8 Nd3 Kh8 Ne5 Rg8 Nf7#
KNvkpp
5 pieces.
- h#11.5
- longest mate
- h#9.5
- deepest unique
- 2
- positions at that depth
- h#9.5
- deepest dual
- h#7
- deepest strict dual
- 213,766,413
- positions with a helpmate
- 553,534
- with a unique solution
- 266,305,536
- cells in the plane
- 86,081,612 bytes
- on disk
Deepest unique problems
Only one distinct idea exists at this depth: 2 positions share a solution.
Deepest dual problems
Deepest dual with different first and last moves: h#7. The deepest dual overall is h#9.5, where the two solutions share a first or a last move.
h#7
8/8/8/4kN2/2p5/3p4/8/2K5 b - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Kf6 Nd6 Kg7 Kd2 Kh8 Ke3 d2 Kf4 d1=R Kg5 Rg1+ Kh6 Rg8 Nf7#
- d2+ Kb2 d1=R Ne3 Kd4 Ka3 Kc3 Ka4 Kb2 Kb4 Ka1 Ka3 Rb1 Nc2#
pure model promotion underpromotion closed-walk self-block nocapture umnov
h#7
7k/7p/6p1/7N/8/K7/8/8 b - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- g5 Nf4 h5 Kb4 h4 Kc5 h3 Kd6 h2 Ke7 h1=R Kf8 Rh7 Ng6#
- h6 Nf4 h5 Kb4 h4 Kc5 h3 Kd6 h2 Ke7 h1=R Kf8 Rh7 Nxg6#
set-play pure model ideal promotion underpromotion excelsior excelsior:black closed-walk self-block single-piece single-piece:black nocheck umnov
h#7
8/5p2/8/4kN2/8/3p4/8/2K5 b - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Kf6 Nd6 Kg7 Kd2 Kh8 Ke3 d2 Kf4 d1=R Kg5 Rg1+ Kh6 Rg8 Nxf7#
- d2+ Kb2 d1=R Ne3 Kd4 Ka3 Kc3 Ka4 Kb2 Kb4 Ka1 Ka3 Rb1 Nc2#
pure model ideal promotion underpromotion closed-walk self-block umnov