h#7
1B6/8/8/8/7B/8/7P/K5k1 b - - 0 1
- Kg2 Bhg3 Kf3 h4 Ke4 h5 Kd5 h6 Kc6 h7 Kb7 h8=Q Ka8 Qh1#
pure model promotion excelsior excelsior:white single-piece single-piece:black nocapture nocheck
KBBPvk
5 pieces.
- h#9
- longest mate
- h#7
- deepest unique
- 556
- positions at that depth
- h#7.5
- deepest dual
- h#7
- deepest strict dual
- 265,550,059
- positions with a helpmate
- 14,982,076
- with a unique solution
- 355,074,048
- cells in the plane
- 210,324,164 bytes
- on disk
Deepest unique problems
h#7
6B1/8/8/8/6B1/2k5/6P1/K7 b - - 0 1
- Kd4 Bh5 Ke5 g4 Kf6 g5+ Kg7 g6 Kxg8 g7 Kh7 g8=Q+ Kh6 Qg6#
pure model promotion excelsior excelsior:white closed-walk single-piece single-piece:black umnov
h#7
1B6/8/8/8/1B6/1P3k2/8/K7 b - - 0 1
- Ke4 Ba5 Kd5 b4 Kc6 b5+ Kb7 b6 Kxb8 b7 Ka7 b8=Q+ Ka6 Qb6#
pure model promotion closed-walk single-piece single-piece:black umnov
Chosen from the first 500 of 556 positions at this depth.
Deepest dual problems
Deepest dual with different first and last moves: h#7. The deepest dual overall is h#7.5, where the two solutions share a first or a last move.
Only one position exists at this depth.
h#7
3B4/8/8/4B3/6k1/3K4/3P4/8 b - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Kf5 Kc4 Ke6 d4 Kd7 d5 Kxd8 d6 Kc8 d7+ Kb7 d8=Q Kc6 Qc7#
- Kh5 Ke4 Kg6 d4 Kf7 d5 Ke8 d6 Kxd8 d7 Ke7 d8=Q+ Ke6 Qe8#
pure model ideal promotion excelsior excelsior:white single-piece single-piece:black umnov