h#7.5
K7/8/8/b7/8/P7/P7/7k w - - 0 1
- Kb8 Bb4 axb4 Kg2 a4 Kf3 a5 Ke4 a6 Kd5 a7 Kc6 a8=Q+ Kb6 Qb7#
KPPvkb
5 pieces.
- h#8.5
- longest mate
- h#7.5
- deepest unique
- 1
- positions at that depth
- h#7
- deepest dual
- h#6.5
- deepest strict dual
- 208,425,711
- positions with a helpmate
- 4,902,747
- with a unique solution
- 266,305,536
- cells in the plane
- 133,773,349 bytes
- on disk
Deepest unique problems
Only one position exists at this depth.
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.
h#6.5
8/8/7k/8/8/Pb6/KP6/8 w - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Ka1 Bd1 b4 Kg5 b5 Kf4 b6 Ke3 b7 Kd2 b8=Q Kc1 Qb2#
- Kxb3 Kg5 a4 Kf4 a5 Ke3 a6 Kd2 a7 Kc1 a8=Q Kb1 Qh1#
pure model ideal promotion excelsior excelsior:white closed-walk self-block single-piece single-piece:black nocheck
Note: the side to move is in check in the diagram.
h#6.5
8/7k/6b1/8/8/3K1P2/P7/8 w - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Kc3 Kh6 f4 Kh5 f5 Kg4 f6 Kf3 f7 Ke2 f8=Q Kd1 Qf1#
- Ke3 Kg7 f4 Kf6 f5 Ke5 fxg6 Kd5 g7 Kc4 g8=Q+ Kc3 Qb3#
pure model mirror promotion single-piece single-piece:black
Note: the side to move is in check in the diagram.
h#6.5
8/1K6/8/8/8/2PP4/6b1/7k w - - 0 1
Two solutions, with different first and last moves (2 starts, 2 ends).
- Ka6 Bc6 d4 Kg2 d5 Kf3 d6 Ke4 d7 Kd5 d8=Q+ Kc5 Qd4#
- Kc7 Be4 dxe4 Kg2 e5 Kf3 e6 Ke4 e7 Kd5 e8=Q Kc5 Qc6#
promotion closed-walk self-block
Note: the side to move is in check in the diagram.