New Year 2015 Puzzle Contest

by Frederic Friedel
1/1/2015 – In the last week of 2014, as every year, we celebrated a week of chess puzzles, this year drawing from problems and studies we had published fifteen years ago. Today we give you four puzzles that are part of our New Year 2015 contest. You have three weeks to work on them, and there are valuable prizes to win. For today we wish all our readers a Happy New Year!

ChessBase 14 Download ChessBase 14 Download

Everyone uses ChessBase, from the World Champion to the amateur next door. Start your personal success story with ChessBase 14 and enjoy your chess even more!


Along with the ChessBase 14 program you can access the Live Database of 8 million games, and receive three months of free ChesssBase Account Premium membership and all of our online apps! Have a look today!

More...

ChessBase 2015 New Year's Puzzle Contest

We trust that you have enjoyed solving our 2014 Christmas puzzles, which were published from December 25 to 31. If you were meditating in a cave in the Hindu Kush mountains during that week and missed them, do not worry: you can review the problems by clicking on the images below, which will take you to specific installments.

Now to our puzzle challenge. We give you three full weeks to solve the following problems – and perhaps win a very nice prize. This will consist of recent ChessBase software, with autographs of top players – at least one a World Champion or ex. And the first prize will probably come with a personal dedication. Note that we have selected puzzles that are not easily accessible to computer solving. What is the point in giving positions that modern chess engines solve in their first seconds of thought? Note too that by some freak accident of the Universe all three problems were provided to us by puzzle king John Nunn.

This is a picture from 1983 of John Nunn composing a problem in my living room during a visit in Germany. Today, over 31 years later, he still supplies my family with chess and mind sport puzzles.

Puzzle one: How can it be a draw?

This is a nice little problem I received from John in 2001. It is one of those typical Nunn things that require no diagram to formulate:

White has a king, a queen and two pawns against Black's bare king.
It is White to move, but he cannot force a win. The game is drawn.

Can you reconstruct the position? The problem has an additional stipulation "White is not stalemated". If it didn't the position on the right would be a possible solution.

Out of curiosity (and not as part of today's task) you may want to think about how much material White can have against the bare black king, be on the move and still not be able to win. Once again: White is not stalemated and can acutally make moves. Prepare to be surprised.

Puzzle two: en passant mate

Many years ago my sons were playing a game of chess against each other. Suddenly one came to me to complain that the other was cheating: "He wants to take a pawn from a square I didn't move it to!" I patiently explained to him that if a pawn moves two ranks forward from its starting position, and an enemy pawn could have captured it had the pawn moved only one square forward, then it can capture the pawn "en passant" (in passing), exactly as if the pawn had moved only one square forward and the enemy pawn had captured it normally. But it could only do so immediately after double-rank move was made.

The face of my son reminded me of the Prince George in the first 40 seconds of this Blackadder clip. "You are joking, right?" he said, and then, sarcastically: "This rule applies on every day of the week?"

The en passant rule was one of the last major changes in European chess, and occurred between 1200 and 1600. The motivation was to prevent the newly added two-square first move for pawns from allowing a pawn to evade capture by an enemy pawn.

And en passant capture occurs in a line of the French advicated by Steinitz (1.e4 e6 2.e5 d5 3.exd6 e.p.) and a main line of the Petroff (1.e4 e5 2.Nf3 Nf6 3.d4 exd4 4.e5 Ne4 5.Qxd4 d5 6.exd6 e.p.). It is also a popular motíf in chess compositions, as you have seen in our December 28 Smyllian puzzle.

Our New Year's puzzle is: What is the shortest game ending with an en passant capture and mate?

It is clear that both sides will be cooperating to bring about an en passant capture with mate. On our JavaScript board below you can play through examples of games ending on move ten, move nine and even move eight. Do you think a shorter sequence is possible, and if so what is the least number of moves required?

[Event "?"] [Site "?"] [Date "2015.01.01"] [Round "?"] [White "Shortest ep-mate"] [Black "Game ends with e.p. capture"] [Result "*"] [ECO "A00"] [PlyCount "19"] 1. g4 (1. e4 g6 2. Ba6 Bg7 3. c4 Bxb2 4. Nc3 Bxc1 5. Nd5 d6 6. Rxc1 Kd7 7. c5 Kc6 8. Qa4+ b5 {[%cal Gb7b5]} 9. cxb6#) (1. c4 d6 2. b4 Kd7 3. g3 Kc6 4. Bg2+ Kb6 5. Qa4 a5 6. bxa5+ Ka7 7. c5 b5 {[%cal Gb7b5]} 8. axb6#) 1... e6 2. e4 Qh4 3. d4 Ke7 4. Qd3 Kf6 5. g5+ Kg6 6. Bh3 Qg3 7. Bxe6 Qxg1+ 8. Rxg1 h5 9. e5+ f5 { [%cal Gf7f5]} 10. gxf6# *

Puzzle three: A logical challenge

This puzzle was given to us – to family and friends, who spent an hour mulling over it – by John Nunn during a pre-Christmas visit this year. In the end a few of us solved it, but not without some fairly painful exertion of a few billion brain cells. The problem is as follows:

A hermit occupies one of six caves. Every day he randomly switches to an adjacent cave.
Every day we search one cave. Is there a strategy to ensure we will find him,
whatever switches he makes? How many times must we seach a cave?

To clarify: if the hermit is in cave one or six he is forced to move to cave two or five, which are next to them. In the four other caves he has two choices. We of course do not know in which cave he is when we start. Our search plan should discover him whatever he does – in fact he can even know our full search plan and still not avoid discovery.

The above is a what we used to solve the problem on the dinner table: six little wooden cups, with a stick to indicate where the hermit was hiding. You make a search plan, consisting of cave numbers (e.g. 1, 3, 5, 4, etc.) and then try to find a strategy for the hermit to circumvent it. A hint: I solved the problem by starting with three caves (2, 2 finds the hermit) and working my way up to six. Your answer should be a series of numbers indicating which caves you would search in which order.

I can tell you it was a very enjoyable dinner. Most enjoyable.

Bonus puzzle four

In case you cannot handle construction or logical problems we will include a final puzzle from our 2001 Christmas puzzle week:

In this picture you see a real child prodigy, one who started playing chess at an unusually early age. This chess prodigy went on to become a very strong grandmaster, one of the best in the world. Tell us who he is.

Send in your solutions

Please use the feedback form at the bottom of this page to submit your solutions. Do not forget to give your full (real) name, the town you live in and your email address – that is if you want to participate in our Christmas Puzzle Prize Contest. This requires that you have solved at least one of the puzzles on this page correctly.

Two winners will be chosen at random from all eligible submissions – we like to reward participation, not getting everything meticulously right. A third prize winner will be selected on the basis of the nicest message (in our opinion) that we receive. Closing date for all entries is January 21, 2015. Note that the arrival date will not influence the selection – so take your time.

And the prizes? They will consist of the most recent ChessBase software, with autographs of top players – at least one a World Champion or ex. And one of the prizes will have a personal dedication and the signatures of all the participants of the 2014 Zurich Chess Challenge – if nothing comes in the way of us getting them. Definitely worth a shot at winning, don't you think?




Editor-in-Chief 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.
Discussion and Feedback Join the public discussion or submit your feedback to the editors


Discuss

Rules for reader comments

 
 

Not registered yet? Register

Malthrope Malthrope 1/3/2015 09:24
+Emrom ~ I would tend to doubt it. It would just confuse the staff here at ChessBase. Sending in 4 solutions on 4 different submissions (replies). Then they would have to assemble all four of your submissions (answers) and then keep track of them in that way. Too much work for them I would think. ;) There should be nothing wrong with sending in only one submission with your final Christmas puzzle answers. :) If you're really concerned about it you could just send feedback in the normal way asking the same question you've posed here. :D

+bro ~ Wish I could help (a precise Russian translation). I have trouble enough just using English?! LoL ;) Regards, - Mal
bro bro 1/3/2015 08:18
Hi, Friends! Happy New 15! Is it possible to translate Puzzle 3 (logical) into Russian for Russian readers? Thank you!
Emrom Emrom 1/3/2015 07:27
If I have solved more than one puzzle, must I send a form for each of them???
Malthrope Malthrope 1/2/2015 07:32
+esta ~ Right on! ;) I'd pretty much tried my best (along with several others doing the very same thing) in all the previous phases of this years ChessBase Christmas Puzzle contest (2014-2015) to continually point out in the following statement. Made by Frederic Freidel (Editor-in-Chief and author of these fantastically entertaining and informative articles) applies to everyone posting here:

"Please do not post any solutions in the discussion section below and spoil the fun for everyone else. Nobody will admire you for it, and some will be extremely annoyed. Just keep it all to yourself."

It even came with variations but all had the same message. Nothing spoils the fun more then those boasting their answers out loud by posting their probable solutions to what we love to solve all by ourselves. No help necessary ~ "Thank You!" very much. :-) So, cool it! Capiche?

Wishing "Good Luck" and strong Chess problem solutions to everyone! :XD

Best Regards, - Malthrope (Berkeley, CA // USA)
esta esta 1/2/2015 05:53
Hey you guys, your comments are just ruining it for everybody.
MaxDev MaxDev 1/2/2015 11:03
@rubix: the hermit would be easy to solve with a computer, yes, but is also a logic problem. I am a programmer, but saw no need to resort to the computer in order to solve it. As Frederic suggests, working upwards from a strategy for 3, then 4 cups quickly leads to a pattern for a strategy which appears to work for an arbitrary number of cups, and does not have any limitations to whether the hermit can occupy a just-searched cave.
Hint 1: think about whether the hermit can be "limited" to just odd or just even caves by your strategy.
Hint 2: You need never search the end caves (but I think you knew that).
Bandesz Bandesz 1/2/2015 05:07
I started uploading the solutions of these lovely puzzles on my youtube channel. If you are stuck on a problem (or want to see the channel), check it out:

https://www.youtube.com/user/TheBestChessPuzzles

PS: I may not be able to solve all of them but I will try my mighty best!:)
rubix rubix 1/2/2015 12:56
This could be a whole new game, apart from chess!
rubix rubix 1/2/2015 12:50
Explained by Friedrich, I mean
rubix rubix 1/2/2015 12:48
The strategy explained only works if the hermit cannot immediately occupy territory recently vacated by the pursuers
rubix rubix 1/2/2015 12:19
I might have made the classic computer programmer -1 error. So the solution could be a random 1-3-2-2-3-1
rubix rubix 1/1/2015 11:06
Recursive programming methods seem ideal here
rubix rubix 1/1/2015 10:03
But the problem is not fair. A computer programmer can solve it easily, as formulated. It is not a chess problem
rubix rubix 1/1/2015 09:46
2-1-1-2 is an alternate random plan
rubix rubix 1/1/2015 09:27
A 1-2-2-1 random strategy between caves 2
and 5?
rubix rubix 1/1/2015 08:18
It is easy to solve the problem with only 2 or 3 caves so the problem is an algorithm that solves the problem with 6 caves
rubix rubix 1/1/2015 08:11
divide the hermit problem in two?
1