h#9
8/6k1/8/p3p3/8/8/1B6/K7 b - - 0 1
- Kh8 Ba3 e4 Kb2 e3 Kc3 e2 Kd4 e1=N Ke5 Nf3+ Kf6 Ng5 Bf8 Nh7+ Kf7 a4 Bg7#
KBvkpp
5 pieces.
- h#16
- longest mate
- h#9
- deepest unique
- 51
- positions at that depth
- h#10
- deepest dual
- h#7.5
- deepest strict dual
- 208,425,746
- positions with a helpmate
- 565,566
- with a unique solution
- 266,305,536
- cells in the plane
- 72,129,849 bytes
- on disk
Deepest unique problems
h#9
8/3Kp3/5k2/8/2p5/8/7B/8 b - - 0 1
- c3 Bd6 c2 Bxe7+ Ke5 Kc6 Kd4 Kb5 Kc3 Ka4 Kb2 Ba3+ Ka1 Kb3 c1=N+ Kc2 Na2 Bb2#
h#9
1K5B/2p5/8/4p3/2k5/8/8/8 b - - 0 1
- c5 Kc7 Kb3 Kd6 c4 Kxe5 c3 Ke4 c2 Bb2 Ka2 Ba3 Ka1 Kd3 c1=N+ Kc2 Na2 Bb2#
pure model ideal promotion underpromotion excelsior excelsior:black switchback self-block umnov
Deepest dual problems
Deepest dual with different first and last moves: h#7.5. The deepest dual overall is h#10, where the two solutions share a first or a last move.
h#7.5
3k4/3p4/5p2/6B1/8/8/8/K7 w - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Bd2 f5 Kb2 f4 Kc3 f3 Kd4 f2 Ke5 f1=B Kf6 Ba6 Kf7 Bc8 Ba5#
- Be3 f5 Kb2 f4 Kc3 f3 Kd4 f2 Ke5 f1=B Kf6 Ba6 Kf7 Bc8 Bb6#
pure model ideal promotion underpromotion self-block single-piece single-piece:black nocapture nocheck
h#7.5
8/4B3/6p1/5k2/1p6/8/1K6/8 w - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Bc5 b3 Kc3 Kf6 Kd4 Kg7 Ke5 Kh8 Kf6 b2 Kxg6 b1=B+ Kf7 Bh7 Bd4#
- Bd6 b3 Kc3 Kf6 Kd4 Kg7 Ke5 Kh8 Kf6 b2 Kxg6 b1=B+ Kf7 Bh7 Be5#
h#7.5
8/8/Kp6/8/6pk/8/3B4/8 w - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Bc3 b5 Kb6 b4 Kc5 b3 Kd4 b2 Ke3 b1=B Kf2 Bg6 Kg2 Bh5 Bf6#
- Ba5 b5 Kb6 b4 Kc5 b3 Kd4 b2 Ke3 b1=B Kf2 Bg6 Kg2 Bh5 Bd8#
pure model ideal promotion underpromotion self-block single-piece single-piece:black nocapture nocheck umnov