h#13
K7/8/3p4/8/8/2k5/8/5Br1 b - - 0 1
- d5 Kb7 d4 Kc6 d3 Kd5 d2 Ke4 d1=N Kf3 Ne3 Kf2 Kd2 Kxg1 Ke1 Kh2 Kf2 Kh3 Kg1 Kg3 Kh1 Bh3 Nf1+ Kf2 Nh2 Bg2#
pure model ideal promotion underpromotion closed-walk self-block umnov
KBvkrp
5 pieces.
- h#16.5
- longest mate
- h#13
- deepest unique
- 2
- positions at that depth
- h#13
- deepest dual
- h#8.5
- deepest strict dual
- 505,776,770
- positions with a helpmate
- 1,152,202
- with a unique solution
- 355,074,048
- cells in the plane
- 168,186,156 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#8.5. The deepest dual overall is h#13, where the two solutions share a first or a last move.
Only one position exists at this depth.
h#8.5
2K5/3B4/k7/2r5/8/7p/8/8 w - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Kb8 Kb6 Bc8 Kc6 Ka7 Kd5 Kb6 Ke4 Kxc5 Kf3 Kd4 Kg2 Ke3 Kh1 Kf2 h2 Bb7#
- Kd8 h2 Bf5 Kb5 Ke7 Kc4 Kf6 Kd4 Kg5 Ke3 Kg4 Kf2 Be4 Kg1 Kf3 Kh1 Kf2#
Note: the side to move is in check in the diagram.