Christmas week puzzles solutions 3

by Frederic Friedel
1/7/2026 – In the final sections of our Christmas Puzzle Week we brought you a variety of famous and less well-known puzzles. Among them a mate problem that solves itself – literally. And one that looks deceptively simple, but requires a very subtle strategy to find the win. In no less than 46 moves! Can computers solve it?

Your personal chess trainer. Your toughest opponent. Your strongest ally.
FRITZ 20 is more than just a chess engine – it is a training revolution for ambitious players and professionals. Whether you are taking your first steps into the world of serious chess training, or already playing at tournament level, FRITZ 20 will help you train more efficiently, intelligently and individually than ever before. 

December 30th, 2025

Christmas Puzzle 14 – Text

If you exclude the squares a1 and h8, can you cover the board with 31 dominos?

Solution: No. A domino will always cover one white and one black square. As a1 and h8 are black, we are trying to cover 32 white and 30 black squares with dominos. This is impossible.

Christmas Puzzle 15 – Text

On an empty chessboard there is a rook on a1. It can only move one square at a time. Can it move onto every square on the board just once and end on the squares 1) a8 and on 2) h8?

Solution: The answer to part 1 is yes. A potential sequence of rook moves is a1-b1-c1-...-h1-h2-g2 -...- a2-a3-b3-...-h3-h4-...-a4-a5-...-h5-h6-...-a6-a7-...-h7-h8-...-a8.

The second part cannot be done because we need to make 63 moves to cover the whole board. After an odd number of moves the rook moves onto a white square. As h8 isn't white we cannot finish on it. The rook can easily reach the target square a8, which is white.  

Christmas Puzzle 16 – Text

What is the greatest number of different mates in one move that can be delivered in a position with only the two kings and two white queens on the board?

Here is the position we were looking for:

White to play has 15 different ways to mate Black in one move. Note that the position with wQd6 instead of wQd5 is not correct, since Black could not have made the last move, and it must be Black to move. The diagram above could have arisen from wKg7, Qc1, d5; bKe7, after which 1.Qc7+ Ke8 was played – and it is White to play. 

There are seven mirrored positions that also work.

December 31st, 2025

Christmas Puzzle 17 + 18 – One-movers

Solutions

  • Madeley: Did you see it? 1.f4 mate is not so easy to spot.
  • Fabel: 1.Rc6! The only move that does not mate Black

Christmas Puzzle 19 + 20 – Direct mates

Solutions

Pollmächer: White has 47 moves that deliver mate – count them if you don't believe it.

Fabel: There is only one place on the board for the black king where White can mate in one. It cannot be on c1 because then the white king must have moved to let it in, and so castling is illegal and there is no mate in one. So the black king must be placed on f3 and the mating move is 1.0-0.

Christmas Puzzle 21 Direct mate

Vilhelm Roepke, Skakbladet, 1942
White to play and win

This is the easiest chess study ever composed: 1.d4 b5 2.d5 b4 3.axb4 a3 4.b5 a2 5.b6 a1=Q 6. b7 mate. Every move by both sides (except the irrelevant black promotion) is the only legal move in the position.

Christmas Puzzle 22 Direct mate

Fabel: White to play and win – how many moves?

Are there any chess engines out there that will announce mate in the initial position?


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.
Discussion and Feedback Submit your feedback to the editors


Discuss

Rules for reader comments

 
 

Not registered yet? Register

Frits Fritschy Frits Fritschy 1/9/2026 01:51
According to www.yacpdb.org, nr. 21 is by Vilhelm Roepke (oe = o+/), Skakbladet, 1942.
Zvi Mendlowitz Zvi Mendlowitz 1/8/2026 09:05
In Fabel's "Don't mate in 1" problem, what is the purpose of the black knights?
Zvi Mendlowitz Zvi Mendlowitz 1/8/2026 03:38
About the first two chess problems, here are two more variations for the next time you meet Indian talents:
1. Suppose you cover the chessboard with 32 dominoes. Prove that the number of dominoes places horizontally is even.
2. As in your second text problem a rook starts from a1 and moves only one square at a time. After 63 moves it was places on all 64 squares and makes one more move to end up on a1. Prove that the number of horizontal moves made by the rook is not 32.
And by the way in your second text problem the rook can end on h8. Move like this: a1-b1-a1-b2... it is not hard to complete the solution. This is legal since the problem says "move onto every square on the board just once". the move from b1 to a1 is legal since the rook never moved before unto a1 (rather it started from a1). Similarly the solution given in the text for finishing on a8 is incorrect since in the path given the rook never moves unto a1. Actually there is no solution for moving unto each square once and finishing on a8, and there is a solution for moving unto each square once and finishing on h8 - the exact opposite of what the given solution claims.
Frits Fritschy Frits Fritschy 1/7/2026 01:08
My 20 year old Fritz10 finds the right plan within seconds: lose a tempo with Bf1-g2-h3-f1 and than return to the queenside, so you could assume that it 'understands' the position. And although it doesn't seem to calculate to the end, it gives a +5 evaluation.
MickyMaus90 MickyMaus90 1/7/2026 12:01
Dear Frederic,
I had great fun looking at your puzzles, especially the last set (#7)! I love these "anti-problems", like 21 (everything is forced) or 18 (find the only move not to mate).
In 22, Black can prolong his resistance by one move by 38...Ka1 39.Bb1 c4 or 38...Ka3 39.Kb1 c4 etc. So it is a mate in 47 moves.
I hope you have some puzzles left for next Christmas!
Best wishes, Wolfram
1