h#8
8/8/8/4k3/2p5/8/8/K3B3 b - - 0 1
- c3 Bh4 c2 Kb2 c1=N Kc2 Kd4 Kd1 Kc3 Be7 Kb2 Ba3+ Ka1 Kc2 Na2 Bb2#
pure model ideal promotion underpromotion switchback self-block nocapture umnov
KBvkp
4 pieces.
- h#16
- longest mate
- h#8
- deepest unique
- 16
- positions at that depth
- h#9
- deepest dual
- h#6.5
- deepest strict dual
- 9,426,816
- positions with a helpmate
- 14,360
- with a unique solution
- 5,548,032
- cells in the plane
- 2,251,961 bytes
- on disk
Deepest unique problems
h#8
8/8/5k2/8/8/2p3B1/8/1K6 b - - 0 1
- c2+ Kb2 c1=N Bh4+ Ke5 Kc2 Kd4 Kd1 Kc3 Be7 Kb2 Ba3+ Ka1 Kc2 Na2 Bb2#
pure model ideal promotion underpromotion switchback self-block nocapture
h#8
8/8/2k5/8/2K5/1B3p2/8/8 b - - 0 1
- f2 Kd3 f1=N Ba4+ Kd5 Ke2 Ke4 Ke1 Kf3 Bd7 Kg2 Bh3+ Kh1 Kf2 Nh2 Bg2#
pure model ideal promotion underpromotion self-block nocapture
Deepest dual problems
Deepest dual with different first and last moves: h#6.5. The deepest dual overall is h#9, where the two solutions share a first or a last move.
Only 2 distinct ideas exist at this depth.
h#6.5
8/K7/2k5/8/8/7p/8/5B2 w - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Bb5+ Kd5 Kb6 Ke4 Kc5 Kf3 Kd4 Kg2 Ke3 Kh1 Kf2 h2 Bc6#
- Ba6 Kd5 Kb6 Ke4 Kc5 Kf3 Kd4 Kg2 Ke3 Kh1 Kf2 h2 Bb7#
h#6.5
8/K7/2k5/8/6B1/7p/8/8 w - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Bd7+ Kd5 Kb6 Ke4 Kc5 Kf3 Kd4 Kg2 Ke3 Kh1 Kf2 h2 Bc6#
- Bc8 Kd5 Kb6 Ke4 Kc5 Kf3 Kd4 Kg2 Ke3 Kh1 Kf2 h2 Bb7#