h#8
8/8/3p4/8/8/1k6/N7/K7 b - - 0 1
- d5 Kb1 d4 Kc1 d3 Kd2 Kb2 Nb4 Ka1 Kc3 d2 Kb3 d1=R Ka3 Rb1 Nc2#
pure model ideal promotion underpromotion self-block nocapture nocheck umnov
KNvkp
4 pieces.
- h#11.5
- longest mate
- h#8
- deepest unique
- 4
- positions at that depth
- h#8
- deepest dual
- h#6.5
- deepest strict dual
- 9,685,572
- positions with a helpmate
- 12,973
- with a unique solution
- 5,548,032
- cells in the plane
- 3,086,207 bytes
- on disk
Deepest unique problems
Only 2 distinct ideas exist at this depth.
h#8
8/8/4p3/8/8/1k6/N7/K7 b - - 0 1
- e5 Kb1 e4 Kc1 e3 Kd1 Kb2 Nb4 Ka1 Kc2 e2 Kb3 e1=R Ka3 Rb1 Nc2#
pure model ideal promotion underpromotion self-block nocapture nocheck
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.
Only one position exists at this depth.
h#6.5
8/8/4Nk2/8/8/3p4/8/2K5 w - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Nd8 Kg7 Kd2 Kh8 Ke3 d2 Kf4 d1=R Kg5 Rg1+ Kh6 Rg8 Nf7#
- Nf8 Kg7 Kd2 Kh8 Ke3 d2 Kf4 d1=B Kg5 Bb3 Kh6 Bg8 Ng6#
pure model ideal promotion underpromotion self-block nocapture umnov