Now we don't want our readers spending the next years trying to solve these proof games, so here are the solutions. Labelle's composition was published in the April - June 2012 issue of the US chess problem magazine StrateGems. In 2004 the Canadian mathematical chess explorer François Labelle undertook a monumental computer search, performed over eight years, and then published the first dualfree proof game resulting in bare kings! The position on the right (wKe5, bKe2) can only be reached in 20 moves – actually 19.5 moves, since it ends with 20.Kxe5. How about the requirement of having a unique solution, one in which every move and the move order is forced? Numerous unsuccessful attempts were made until 2012 – there were always duals. Loyd's problem had multiple solutions, but at least the position displayed could not be reached in fewer moves. Starting from the initial position you should reach the position on the left (wKe2, bKe7) in 17 moves. The first was published in 1895 by Sam Loyd. Sam Loyd: proof game in 17 – François Labelle, proof game in 20 In similar vein, Werner Keym draws attention to these two historical king-only proof games: Hint: there are six black pieces missing, so White must have captured six times! The book is no longer in print, but you can read it or download the full PDF, absolutely free of charge, from the Schwalbe website here.Īnd now, to celebrate his 80th birthday, here are a few examples from his recent book (" Anything but Average,"link and purchase option at the end of this article): In return for this "service" I am allowed to show you examples from them ad libitum, on our news page, together with his notes and comments. I have helped with comments and suggestions for his books – and with proof-reading. The focus is "out of the box" problems: en-passant capture, rotation, adding pieces, retro puzzles, text problems, proof games, special stipulations, jokes etc. Also his meticulous quest for accuracy.įor decades Werner Keym has published studies and chess problems. For many years I have enjoyed his problems, and his chess humour. Werner Keym specializes in problems involving castling, en passant captures and pawn promotion. The next time we see a palindromic date will be on the third of February 2030. Today he turns eighty – and Werner Keym noted the palindrome in the date: can be read backwards and forwards.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |