Sources
Authors
Keywords
Fairy Pieces
Statistic
FAQ
Acknowledgement
New Comments
since yesterday
since last week
since last 4 weeks
since last 8 weeks
New Problems
since last week
PDB Account
Login
Samuel Loyd New York Clipper 1895 157 American Chess Magazine 12/1897 RA33 diagrammes 20 03-04/1976 2 Shortest Proof Games 11/1991  (1+1) BP in 17,0      | 1. c4 d5 2. cxd5 Dxd5 3. Dc2 Dxg2 4. Dxc7 Dxg1 5. Dxb7 Dxh2 6. Dxb8 De5 7. Dxc8+ Txc8 8. Txh7 Dxb2 9. Txh8 Dxa2 10. Txg8 Dxd2+ 11. Kxd2 Txc1 12. Txg7 Txb1 13. Txf7 Txf1 14. Txf8+ Kxf8 15. Txa7 Txf2 16. Txe7 Txe2+ 17. Kxe2 Kxe7 |
| AB: Is this one C+? If so, it is impressive for its time. (2001-10-17) GW: The game is not unique (for example moves 14 and 15 may be exchanged). I am also quite sure that there are different ways to reach the position, but nevertheless the problem is very impressive. (2001-10-17) Francois Labelle: My computer says there are 272810 solutions (292397 solutions without Article 1.3 of the Laws). The minimum is 4 solutions for a (1+1) SPG in 17.0 moves. (2004-2-3) comment | |
Keywords: Proof Game, Massacre PGs, only Kings Genre: Retro Input: Gerd Wilts, 1995-6-3 Last update: Frank Müller, 2010-1-30 more... |
Show statistic for complete result.
The problems of this query have been registered by the following contributors:
Gerd Wilts (1)