1/12/2020 – Last year we rivived our twenty-year tradition of giving you unusual puzzles for the Christmas holidays — puzzles that cannot be easily solved with a computer (the point of this endeavour), tasks which require you to think all by yourself. Sadly the greatest problematist, Pál Benkö, who faithfully contributed to this endeavour, could only make one contribution, for Christmas day, before passing (at 91 last August). We hope you enjoyed the puzzles and were able to solve some yourself.

1/5/2020 – In the early 1980s, FREDERIC FRIEDEL spent a week in Moscow with Unix pioneer Ken Thompson, who was supposed to demonstrate his computer chess world champion machine Belle to the Soviet Chess Federation, and to former World Champion Mikhail Botvinnik, who was developing a rival strategy in chess programming. He takes us on a trip down memory lane. Read part 1.

1/4/2020 – In the early 1980s, FREDERIC FRIEDEL spent a week in Moscow with Unix pioneer Ken Thompson, who was supposed to demonstrate his computer chess world champion machine Belle to the Soviet Chess Federation, and to former World Champion Mikhail Botvinnik, who was developing a rival strategy in chess programming. Unfortunately Thompson's computer did not arrive with him in Moscow. But in spite of this, the trip turned out to be quite an adventure.

12/29/2019 – When grappling with a challenging chess puzzle, there's often the temptation to feed it to a chess engine to a little help. For today's puzzles, that's not an option. Emeritus Editor FREDERIC FRIEDEL has selected problems by Dr Karl Fabel and Thomas Rayner Dawson, "the father of Fairy Chess". Not sure what that means? Read on!

12/27/2019 – During the Christmas puzzle week we normally strive to bring you puzzles that cannot be solved by simply pressing some key on your computer. But here I would like to simply tell you a story of how ancient, well-known problems can electrify budding young chess players. In the board position shown, it's White to play and draw!

12/26/2019 – Christmas Puzzle week, which we bring you for the twentieth year in succession, is time for unusual and entertaining puzzles — tasks that are not amenable to computer assistance, but require human ingenuity. Try, for instance, to imagine how the position in the picture could have possibly arisen. Determining that needs lateral thinking. One of the foremost composers of chess problems "out of the box" sent us some highly entertaining examples. At least one of them looks quite impossible. Merry Boxing Day!

12/25/2019 – Every year Pal Benko, grandmaster, former World Championship candidate, and one of the best problem composers in the world, sent us some very special seasonal greetings. They came in the form of chess problems for our readers. Just weeks before his death (at 91 last August) Pal started working on this year's Christmas puzzles. Unfortunately he was only able to suggest the first one, for Christmas Day. It is a problem by Sam Loyd and was supposed to fool our readers (Pal retained his humour and mischievous nature to the end). We share this puzzle with you today.

12/12/2019 – Just imagine you had a chess computer — the auto-sensor kind. Would someone who had no knowledge of the game be able to work it out, just by moving pieces. Or imagine you are a very powerful computer. By looking at millions of images of chess games would you be able to figure out the rules and learn to play the game proficiently? The answer is yes — because that has just been done by Google's Deep Mind team. For chess and 76 other games. It is interesting, and slightly disturbing. | Graphic: DeepMind

11/14/2019 – In the past decade brute force programs became stronger than any human chess player, and now self-learning artificial intelligence programs like AlphaZero, Leela and Fat Fritz take these skills even further. What this all means is of great interest, and chess is simply the first area in which we are acutely feeling the impact of Artificial Intelligence. Thankfully computer experts, philosopher, and thinkers are beginning to discuss the subject seriously — as in this fairly profound podcast with Judea Pearl and Sam Harris, who use the chess paradigm extensively in their discussion. Definitely worth listening.

11/6/2019 – Are strong chess players generally better at logical thinking than people who rarely play the game? Can super-talented youngsters, of GM strength, solve logical puzzles better than amateurs or non-chess kids of the same age? Or are both equally good, or are the chess kids perhaps worse? ChessBase chief editor emeritus Frederic Friedel is conducting an experiment to find out. Today he tells us how his experiments so far have been conducted. Perhaps you can join in and supply your own results. Or at least have fun with his problems!

11/4/2019 – When Paul Morphy played Adolf Anderssen in 1858, only two games of the eleven in total were drawn. Steinitz vs Lasker in 1894 produced four draws in 19 games, but when Capablanca played Lasker in 1921 there were already ten draws in 14 games. In the Carlsen-Caruana match last year all twelve regular games were drawn, so the title had to be decided in tiebreaks. But such tiebreaks involve rapid chess game, blitz and even the ominous Armageddon. Is there a way to decide the World Championship in classical games only? Problemist Werner Keym has proposed a format that does exactly this. What do you think?

10/17/2019 – It is arguably one of the most elegant problems ever composed. The author is the late Pal Benko, a world class grandmaster and World Championship contender, who earned an additional ticket to immortality with his problems and endgame studies. The problem he composed when he was fifteen still occupies the nonagenarian. It has a dual, and we challenged our readers to find a modification to cure that. A large number tried. Today we show you Pal Benkös's own "correction".

10/7/2019 – Problem solving is a challenging field, with young participants generally dominating. There is one exception. Year after year a British mathematician, grandmaster and chess writer gives the strongest and brightest a run for their money. This year 64-year-old John Nunn finished a close second, and reported on this success. Today he presents, in his own inimitable style, the solutions to seven of the problems he had to solve at the 43rd World Chess Solving Championship in Vilnius. Our picture shows John Nunn winning the silver medal at the WCCC2019 in Vilnius and composing a chess problem, in the mid 1980s.

9/12/2019 – It is inspired by the remarkable Google/DeepMind development that shocked the world: AlphaZero. Using the open source code of Leela we generated a neural network based on millions of auto-play games — but also added millions of high level human and computer-vs-computer games, and endgame tablebases. The result: a program that strong GMs are experimenting with — and they are fascinated with the ideas our engine produces. Even very young chess geniuses are fans of Fat Fritz. | Photo Frederic Friedel

9/4/2019 – As we reported last week, Vladimir Kramnik conducted a special training camp in Chens-Sur-Léman, France, for six very talented Indian youngsters, all in their early teens, but already GMs or close to winning the title. The camp was sponsored by the Chennai-based company Microsense Private Limited and ended last Saturday. ChessBase editor Frederic Friedel visited the camp and watched the interaction between the kids and the former World Champion. | Photos: Amruta Mokal and Frederic Friedel

8/30/2019 – It was with great sorrow that we learned, last Monday, of the passing of grandmaster Pal Benko, a world class player who earned an additional ticket to immortality with his problems and endgame studies. Recently we had shown you one of his most elegant chess problems, composed when he was just fifteen. It was a problem that still occupied the nonagenarian. In one line it has a dual, and at Pal's behest we challenged our readers to find a modification to cure that. A large number tried. Today we announce the winner of the competition.

8/27/2019 – He was a world-class grandmaster, twice World Champion candidate, friend of Bobby Fischer (whose participation in the 1972 World Championship match he directly enabled), inventor of the eponymous Benko Gambit and the 1.g3 Benko Opening (which he used to beat Fischer and Tal). He is also known as the composer of some of the finest endgame studies and chess problems we have ever seen. Pál was also a loyal friend who provided us with countless articles over the last decade. He will be deeply missed. | Photo Diana Mihajlova.

7/24/2019 – Wolfram Runkel (1937-2019) was a journalist and writer of the prestigious Hamburg weekly "Die Zeit". In this role he was the founder of the tradition of chess reporting in a mainstream outlet. He was also a pioneer in bringing the subject of computer chess to the attention of the German public and, notably, of a young journalist who went on to co-found a large chess software company. Runkel died last Friday after a long illness. Read Frederic Friedel's personal eulogy. | Photo: Hans Walter Schmitt