h#7
8/8/8/8/2B5/2PK4/2P4k/8 b - - 0 1
- Kg3 Ba6 Kf4 c4 Ke5 c5 Kd5 c6 Kc5 c7 Kb6 c8=Q Ka7 Qb7#
pure model promotion single-piece single-piece:black nocapture nocheck umnov
KBPPvk
5 pieces.
- h#8
- longest mate
- h#7
- deepest unique
- 12
- positions at that depth
- h#7
- deepest dual
- h#6.5
- deepest strict dual
- 208,934,087
- positions with a helpmate
- 10,532,011
- with a unique solution
- 266,305,536
- cells in the plane
- 187,060,315 bytes
- on disk
Deepest unique problems
h#7
7k/7P/8/8/8/1KB5/1P6/8 b - - 0 1
- Kxh7 Ka2 Kg6 b4 Kf5 b5 Ke4 b6 Kd3 b7 Kc2 b8=Q Kc1 Qb1#
promotion excelsior excelsior:white single-piece single-piece:black nocheck
Note: the side to move is in check in the diagram; the solution begins with a capture.
h#7
8/8/8/8/K7/4B3/P3P3/7k b - - 0 1
- Kg2 Kb3 Kf1 a4 Kxe2 a5 Kxe3 a6 Kd2 a7 Kc1 a8=Q Kb1 Qh1#
pure model ideal mirror promotion excelsior excelsior:white single-piece single-piece:black nocheck
Deepest dual problems
Deepest dual with different first and last moves: h#6.5. The deepest dual overall is h#7, where the two solutions share a first or a last move.
Only one position exists at this depth.
h#6.5
8/8/8/8/BK6/PP6/7k/8 w - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Bb5 Kg3 a4 Kf4 a5 Ke5 a6 Kd6 a7 Kc7 a8=Q Kb6 Qb8#
- Bc6 Kg3 a4 Kf4 a5 Ke5 a6 Kd6 a7 Kc7 a8=Q Kb6 Qb7#
pure model promotion single-piece single-piece:black nocapture nocheck