KBvkqrn
6 pieces.
- h#12.5
- longest mate
- h#9.5
- deepest unique
- 394
- positions at that depth
- h#9.5
- deepest dual
- h#8.5
- deepest strict dual
- 8,146,473,309
- positions with a helpmate
- 25,435,326
- with a unique solution
- 7,751,073,792
- cells in the plane
- 3,567,595,192 bytes
- on disk
Deepest unique problems
h#9.5
8/1q6/1n6/8/8/8/r7/KBk5 w - - 0 1
- Kxa2 Kd2 Be4 Kc3 Bxb7 Kb4 Ba6 Ka5 Kb3 Nc8 Kc4 Kb6 Kd5 Ka7 Kc6 Ka8 Kc7 Na7 Bb7#
pure model ideal switchback self-block nocheck
Note: the side to move is in check in the diagram; the solution begins with a capture.
h#9.5
8/8/8/8/6n1/5r2/1q6/1K2B1k1 w - - 0 1
- Kxb2 Nf6 Bb4 Kf2 Bf8 Ke3 Kc3 Kf4+ Kd4 Kg5 Ke5 Kg6 Ke6 Kh7 Kf7 Kh8 Kg6 Ng8 Bg7#
Note: the side to move is in check in the diagram; the solution begins with a capture.
Deepest dual problems
Deepest dual with different first and last moves: h#8.5. The deepest dual overall is h#9.5, where the two solutions share a first or a last move.
h#8.5
7q/6n1/8/8/2r5/8/B1k5/K7 w - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Bb1+ Kc3 Ka2 Rh4 Ka3 Kd4 Kb4 Ke5+ Kc5 Kf6 Kd6 Kf7 Bg6+ Kg8 Ke7 Rh7 Bf7#
- Bb3+ Kc3 Kb1 Rc8 Kc1 Kd4+ Kd2 Ke5 Ke3 Kf6 Kf4 Kg6 Bf7+ Kh7 Kg5 Rg8 Bg6#
h#8.5
n7/8/2r5/B5k1/8/2q5/8/K7 w - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Kb1 Qh3 Bc3 Nb6 Kc2 Nc4 Bd2+ Ne3+ Kd3 Kh4 Ke4 Ng4 Kf5 Rc3 Kg6 Rg3 Bg5#
- Ka2 Kf6 Bb6 Qa5+ Kb3 Ke7 Bc5+ Kd8 Kc4 Rc8 Kd5 Nb6+ Ke6 Nd7 Kf7 Qc7 Be7#
pure model ideal self-block nocapture umnov
Note: the side to move is in check in the diagram.