The octogenarian puzzle master

by Frederic Friedel
2/22/2022 – Werner Keym is a teacher (of French and Latin) and a musician who has organised more than 300 concerts in his town. In 2010, he ran for Mayor of Meisenheim and won in a landslide. Now in retirement he devotes his time to the family — he has six grandchildren — and to his hobbies. The foremost of them is problem chess, where he is the is one of the most creative problemists we know. Today he turns 80, and we celebrate with samples of his work. Prepare for an hour of fun.

ChessBase 17 - Mega package ChessBase 17 - Mega package

ChessBase is a personal, stand-alone chess database that has become the standard throughout the world. Everyone uses ChessBase, from the World Champion to the amateur next door. It is the program of choice for anyone who loves the game and wants to know more about it.

More...

Today he turns eighty – and Werner Keym noted the palindrome in the date: 22.02.2022 can be read backwards and forwards. The next time we see a palindromic date will be on the third of February 2030. He never fails to spot such oddities.

Werner Keym specializes in problems involving castling, en passant captures and pawn promotion. For many years I have enjoyed his problems, and his chess humour. Also his meticulous quest for accuracy.

For decades Werner Keym has published studies and chess problems. The focus is "out of the box" problems: en-passant capture, rotation, adding pieces, retro puzzles, text problems, proof games, special stipulations, jokes etc. for which he is a leading specialist. I have helped with comments and suggestions for his books – and with proof-reading. 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. 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.

And 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):

 

The above problem was composed 56 years ago and appeared in the Allgemeine Zeitung Mainz. It is quite remarkable, as you will soon see. The position is truly symmetrical, and for any key move, White would have a mirror move on the other side. So there are two questions: how can White secure a draw in the above position; and why does the mirror solution not work?

In the above diagram we have switched on the engine, so you can actually play out the position against the computer, making sure it does not simply win with Black. Have fun!

This unique problem makes all four castlings an integral part of the solution. In each case not castling will allow a quicker mate. We believe that this has never been shown before.

 

This is an insidious problem you should try to solve on the diagram:

 

There are five tries, each with precisely one refutation (which the diagram engine will play against you). You will not be able to mate in three unless you play the correct key move. To find it you should look at the position carefully – and think out of the box!!

The next problem is a "proof game": you are asked to start from the initial position and reach the position below after White's seventh move:

 

You can try to do so on the following diagram (where you can move pieces):

 

 

Hint: there are six black pieces missing, so White must have captured six times!

In similar vein, Werner Keym draws attention to these two historical king-only proof games:

Sam Loyd: proof game in 17 – François Labelle, proof game in 20

The first was published in 1895 by Sam Loyd. Starting from the initial position you should reach the position on the left (wKe2, bKe7) in 17 moves. Loyd's problem had multiple solutions, but at least the position displayed could not be reached in fewer moves.

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. 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. Labelle's composition was published in the  April - June 2012 issue of the US chess problem magazine StrateGems.

Now we don't want our readers spending the next years trying to solve these proof games, so here are the solutions. Loyd's moves are not unique, Lasalle's absolutely so. You might at least enjoy playing through the "massacre games" that lead to the bare kings.

 

The solutions to all puzzles will be provided next Sunday. Until then happy solving!


Anything but Average, from which the above puzzles were taken, is a chess book aimed at all chess lovers: players and problemists. We quote from the preface:

Over-the-board chess and chess composition complement each other wonderfully: battle and art. A game is a struggle between two people, a composition is the product of an individual. A chess game lives from mistakes, the chess problem dies from them. A game perfectly played by both sides often leads to a colourless draw, a perfect chess composition is an everlasting source of pleasure. Anticipation or plagiarism is irrelevant for the chess player, for the chess composer it means bad luck or violation.

Details: www.berlinthema.de (including a 24-page excerpt)
Second edition (cloth-bound) 2021. 25 € + postage.
Order per e-mail: Ralf.Kraetschmer@t-online.de


Editor-in-Chief emeritus of the ChessBase News page. Studied Philosophy and Linguistics at the University of Hamburg and Oxford, graduating with a thesis on speech act theory and moral language. He started a university career but switched to science journalism, producing documentaries for German TV. In 1986 he co-founded ChessBase.

Discuss

Rules for reader comments

 
 

Not registered yet? Register

Michael Jones Michael Jones 2/25/2022 10:42
The first position is only symmetrical as far as the positions of the pieces relative to each other are concerned. It isn't symmetrical with regard to their locations on the board...
Zvi Mendlowitz Zvi Mendlowitz 2/23/2022 05:19
@brian8871
@Frederic

Chess problem solving program Popeye finds all 25 solutions for Kf2/Kf7 in about 4 seconds, Here is one solution:

1.e2-e4 d7-d5 2.e4xd5 Qd8xd5 3.Bf1-d3 Qd5xa2 4.Bd3xh7 Qa2xb1 5.Ra1xa7 Qb1xc2 6.Ra7xb7 Qc2xc1 7.Qd1xc1 Rh8xh7 8.Rb7xc7 Rh7xh2 9.Rc7xe7+ Ke8xe7 10.Qc1xc8 Rh2xg2 11.Qc8xb8 Rg2xg1+ 12.Rh1xg1 Ra8xb8 13.Rg1xg7 Rb8xb2 14.Rg7xg8 Rb2xd2 15.Rg8xf8 Rd2xf2 16.Rf8xf7+ Ke7xf7 17.Ke1xf2
Zvi Mendlowitz Zvi Mendlowitz 2/23/2022 04:59
@Frederic

Danke schön
Frederic Frederic 2/23/2022 09:54
@Zwi: I solved it in just a couple of minutes (such great talent!) I found it in Werner Keym's book "Out of the Box", No. 184, p. 54. It is by Alex Fishbein, The Problemist 2016: "Find an orthodox game that ends with 7. . . Kxb7#." The solution: 1.d4 c5 2.d4xc5 Sa6 3.Q×d7+ K×d7 4.Kd2 Kc7+ 5.Kc3 Be6 6.c6 Rc8 7.c6×b7 K×b7#. Alex Fishbein and Stuart Rachels collected and composed proof game problems. I wrote about this here: https://en.chessbase.com/post/chessbase-christmas-puzzles-2015-7.
Zvi Mendlowitz Zvi Mendlowitz 2/23/2022 12:26
Speaking of Labelle, I never found the game that ends with 7... Kxb7#. Can you solve it?
https://wismuth.com/chess/problems-moves.html
brian8871 brian8871 2/22/2022 08:38
Frederic, I could if I knew one. I only know that this website says there are 25 possible solutions: https://wismuth.com/chess/problems-massacre.html
Frederic Frederic 2/22/2022 10:53
@brian8871: I spent half an hour trying to adapt Loyd's masacre proof game to end with kings on f2 and f7 -- and did not come close to succeeding. Then I tried googling, and again did not succeed. Frustrating. Can you post a solution here?
brian8871 brian8871 2/22/2022 09:23
As a bonus puzzle, try to reach a position with just the two kings left on squares f2 and f7, after White's 17th move. There are multiple solutions to that as well, but just finding one is hard enough.
1