The first is a study I have tested on dozens of top players – unfortunately, most recognized it immediately. It is one of the most famous and well-loved problems in chess. I myself used it in my Christmas week column on December 30, 2014: My favourite studies. This is what I wrote at the time:
This is not an easy problem. In 1983 the readers of a German computer chess magazine reported that no computer at the time came anywhere close to solving it. I asked Ken Thompson to run it on his Belle machine and we were impressed that the reigning world computer chess champion produced the solution in two minutes and 20 seconds. Today a random chess engine takes 0.00 seconds.
The basic problem is that 1.c8Q doesn't work: 1...Bf5+ 2.Kc7 Bxc8 leaves White helpless, unable to capture the bishop, as that would allow the pawn to run. The black king approaches and supports the duo to win the game.
The only other reasonable alternative, 1.Kd6, also runs into problems after 1...Bf5 2.Kc5 Ke4 3.Kb6 Bc8. Black will now win, e.g. after 4.Kc5 (4.Ka7 b5) 4...Ke5 5.Kb5 Kd6 6.Kb6 Kd7 7.Kc5 Kxc7.
We leave it at that, it's up to you to find the only move that draws. Once again: pull out that old chess set and work it out all by yourself. Pat yourself firmly on the back if you succeed.
Or move the pieces on the above diagram, for which I have allowed the engine to be switched on (click the fan button below the board).
And here are the solutions to all six of the studies we gave you:
Click on the blue arrow pointing right for a list of the studies, left for the notation.
.jpeg)
