KBNvkp
5 pieces.
- h#16
- longest mate
- h#7
- deepest unique
- 50
- positions at that depth
- h#7
- deepest dual
- h#6.5
- deepest strict dual
- 544,945,111
- positions with a helpmate
- 10,653,404
- with a unique solution
- 355,074,048
- cells in the plane
- 332,086,826 bytes
- on disk
Deepest unique problems
h#7
6k1/7p/8/7N/2B5/8/8/K7 b - - 0 1
- Kh8 Nf4 h5 Kb2 h4 Kc3 h3 Kd4 h2 Ke5 h1=R Kf6 Rh7 Ng6#
pure model ideal promotion underpromotion excelsior excelsior:black closed-walk self-block nocapture nocheck umnov
Note: the side to move is in check in the diagram.
h#7
K7/8/2p5/B7/8/8/7N/6k1 b - - 0 1
- c5 Kb7 c4 Kc6 c3 Kd5 c2 Ke4 c1=Q Kf3 Qc6+ Kg3 Qh1 Bb6#
promotion closed-walk self-block single-piece single-piece:black nocapture
Deepest dual problems
Deepest dual with different first and last moves: h#6.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#6.5
6k1/4p3/8/7B/8/8/4N3/K7 w - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Nf4 Kf8 Ng6+ Ke8 Kb2 Kd7 Kc3 Kc6 Ne5+ Kb5 Nc4 Ka4 Be8#
- Bf3 Kf7 Kb1 Ke6 Bg4+ Kd5 Nd4 Kc4 Nc2 Kb3 Kc1 Ka2 Be6#