h#6.5
8/8/6b1/8/8/6k1/3B4/K7 w - - 0 1
- Kb2 Kg4 Kc3 Kf5 Kd4 Kf6 Bc3 Kg7 Ke5 Kh8 Kf6 Bh7 Kf7#
KBvkb
4 pieces.
- h#10
- longest mate
- h#6.5
- deepest unique
- 8
- positions at that depth
- h#7
- deepest dual
- h#5
- deepest strict dual
- 1,493,354
- positions with a helpmate
- 8,976
- with a unique solution
- 1,892,352
- cells in the plane
- 687,146 bytes
- on disk
Deepest unique problems
h#6.5
8/8/8/5bB1/8/7k/8/1K6 w - - 0 1
- Kb2 Kg4 Kc3 Kh5 Kd4 Kg6 Ke5 Kh7 Kf6 Kh8 Kf7 Bh7 Bf6#
Note: the side to move is in check in the diagram.
h#6.5
8/8/8/5bB1/8/6k1/8/K7 w - - 0 1
- Kb2 Kg4 Kc3 Kh5 Kd4 Kg6 Ke5 Kh7 Kf6 Kh8 Kf7 Bh7 Bf6#
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.
Only one position exists at this depth.
h#5
8/5b2/8/4B3/4k3/8/2K5/8 b - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Kf5 Kd3 Kg6 Ke4 Kh7 Kf5 Bg8 Kf6 Kh8 Kg6#
- Ba2 Kb2 Kd3 Ka3 Kc2 Kb4 Kb1 Kc3 Ka1 Kc2#
closed-walk self-block single-piece single-piece:white nocapture nocheck