h#10
2n5/1n6/2q5/8/8/8/7B/1K5k b - - 0 1
- Kg2 Be5 Kf3 Bc3 Ke4 Kc2 Kd5 Kd3 Kd6 Kd4 Kc7 Ke5 Qa4 Ke6 Qa8 Ba5+ Kb8 Kd7 Na7 Bc7#
KBvkqnn
6 pieces.
- h#13
- longest mate
- h#10
- deepest unique
- 5
- positions at that depth
- h#10
- deepest dual
- h#8
- deepest strict dual
- 4,352,701,838
- positions with a helpmate
- 15,715,147
- with a unique solution
- 7,751,073,792
- cells in the plane
- 2,272,666,664 bytes
- on disk
Deepest unique problems
h#10
5n2/6n1/8/1B2q3/8/8/8/k1K5 b - - 0 1
- Ka2 Kd2 Qh2+ Ke3 Kb3 Ba4+ Kc4 Kf3 Kd5 Kg4 Ke6 Kg5 Kf7 Be8+ Kg8 Kf6 Qh8 Ke7 Nh7 Bf7#
h#10
5n2/6n1/8/8/1q4B1/8/2K5/k7 b - - 0 1
- Ka2 Kd3 Kb3 Ke3 Kc4 Bf5 Kd5 Be4+ Ke6 Kf4 Kf7 Ke5 Kg8 Bg6 Qh4 Kd6 Qh8 Ke7 Nh7 Bf7#
Deepest dual problems
Deepest dual with different first and last moves: h#8. The deepest dual overall is h#10, where the two solutions share a first or a last move.
Only one position exists at this depth.
h#8
6n1/8/Bn6/8/8/3k4/3q4/K7 b - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Kd4 Kb1 Qc2+ Kxc2 Kc5 Kd3 Nc8 Ke4 Kb6 Kd5 Ka7 Kc6 Ka8 Kc7 Na7 Bb7#
- Ke4 Bc4 Qd8 Kb2 Ke5 Kc3 Kd6 Kd4 Kd7 Ke5 Ne7 Kf6 Ke8 Kg7 Nd7 Bf7#
Note: the side to move is in check in the diagram.