h#7
8/8/8/8/3R4/2kp4/3N4/2K5 b - - 0 1
- Kxd4 Nf1 d2+ Kb2 d1=R Ka3 Kc3 Ka4 Kb2 Ne3 Ka1 Ka3 Rb1 Nc2#
pure model ideal promotion underpromotion switchback self-block umnov
Note: the solution begins with a capture.
KRNvkp
5 pieces.
- h#11.5
- longest mate
- h#7
- deepest unique
- 6
- positions at that depth
- h#7
- deepest dual
- h#5
- deepest strict dual
- 524,033,321
- positions with a helpmate
- 44,134,007
- with a unique solution
- 355,074,048
- cells in the plane
- 319,279,921 bytes
- on disk
Deepest unique problems
h#7
7k/4N2R/8/8/8/3p4/8/1K6 b - - 0 1
- Kxh7 Kc1 Kg7 Kd2 Kh8 Ke3 d2 Kf4 d1=B Kg5 Bb3 Kh6 Bg8 Ng6#
pure model ideal promotion underpromotion closed-walk self-block nocheck umnov
Note: the side to move is in check in the diagram; the solution begins with a capture.
h#7
7k/4N1p1/7R/8/8/8/K7/8 b - - 0 1
- gxh6 Kb3 h5 Kc4 h4 Kd5 h3 Ke6 h2 Kf7 h1=R Kf8 Rh7 Ng6#
pure model ideal promotion underpromotion excelsior excelsior:black self-block single-piece single-piece:black nocheck
Note: the side to move is in check in the diagram; the solution begins with a capture.
Deepest dual problems
Deepest dual with different first and last moves: h#5. The deepest dual overall is h#7, where the two solutions share a first or a last move.
h#5
8/8/8/6k1/8/p4R2/K7/N7 b - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Kg4 Rb3 Kf4 Rb2 Ke3 Nc2+ Kd2 Ne3+ Kc1 Rc2#
- Kh6 Kb3 a2 Nc2 a1=R Nd4 Rg1 Ne6 Rg6 Rh3#
set-play pure model promotion underpromotion self-block single-piece single-piece:black nocapture umnov
h#5
8/8/7k/8/p3R3/8/K7/N7 b - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Kg5 Re2 Kf4 Rb2 Ke3 Nc2+ Kd2 Ne3+ Kc1 Rc2#
- a3 Kb3 a2 Nc2 a1=R Nd4 Rg1 Ne6 Rg6 Rh4#
pure model promotion underpromotion self-block single-piece single-piece:black nocapture umnov