h#12
K7/1B6/8/4q3/8/1p6/k7/8 b - - 0 1
- b2 Ka7 Kb3 Kb6 Kc4 Ba6+ Kd5 Kb5 Ke4+ Kc4 Kf3 Kd3 Kg2 Kd2 Kh1 Be2 b1=N+ Ke1 Nd2 Kf2 Nf3 Bf1 Nh2 Bg2#
pure model promotion underpromotion self-block nocapture umnov
KBvkqp
5 pieces.
- h#17
- longest mate
- h#12
- deepest unique
- 3
- positions at that depth
- h#12.5
- deepest dual
- h#8
- deepest strict dual
- 466,452,535
- positions with a helpmate
- 1,041,194
- with a unique solution
- 355,074,048
- cells in the plane
- 177,157,066 bytes
- on disk
Deepest unique problems
h#12
2K5/1B6/8/4q3/1p6/1k6/8/8 b - - 0 1
- Kc4 Ba6+ Kd5 Kb7 b3 Kb6 b2 Kb5 Ke4+ Kc4 Kf3 Kd3 Kg2 Kd2 Kh1 Be2 b1=N+ Ke1 Nd2 Kf2 Nf3 Bf1 Nh2 Bg2#
pure model promotion underpromotion self-block nocapture umnov
h#12
2K5/1B6/8/1p2q3/2k5/8/8/8 b - - 0 1
- b4 Ba6+ Kd5 Kb7 b3 Kb6 b2 Kb5 Ke4+ Kc4 Kf3 Kd3 Kg2 Kd2 Kh1 Be2 b1=N+ Ke1 Nd2 Kf2 Nf3 Bf1 Nh2 Bg2#
pure model promotion underpromotion self-block nocapture umnov
Deepest dual problems
Deepest dual with different first and last moves: h#8. The deepest dual overall is h#12.5, where the two solutions share a first or a last move.
h#8
8/2p5/8/2K5/7q/8/B5k1/8 b - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Kh1 Kb5 c5 Be6 c4 Bg4 c3 Kc4 c2 Kd3 c1=B Ke2 Bf4 Kf1 Bh2 Bf3#
- Kh3 Kd5 c5 Bb1 c4 Be4 c3 Kd4 c2 Ke3 c1=B+ Kf3 Bf4 Bd3 Bh2 Bf1#
promotion underpromotion excelsior excelsior:black self-block nocapture umnov
h#8
5k2/3K4/8/8/8/p5q1/7B/8 b - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Kf7 Kc6 Ke6 Kb6 Kd5 Bxg3 Kc4 Be5 Kb3 Kc5 Ka2 Kd4 Ka1 Kc3 a2 Kc2#
- a2 Kc6 Ke7 Kb5 Kd6 Kc4 Qf4+ Kd3 Kc5 Bg1+ Kb4 Be3 Ka3 Kc3 Qa4 Bc1#
h#8
8/2p5/2K5/8/7q/8/B6k/8 b - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Kh1 Kb5 c5 Be6 c4 Bg4 c3 Kc4 c2 Kd3 c1=B Ke2 Bf4 Kf1 Bh2 Bf3#
- Kh3 Kd5 c5 Bb1 c4 Be4 c3 Kd4 c2 Ke3 c1=B+ Kf3 Bf4 Bd3 Bh2 Bf1#
promotion underpromotion excelsior excelsior:black self-block nocapture umnov