3/16/2017 – That, in fact, is what the newly founded Penrose Institute is suggesting. The founder, famous mathematician Sir Roger Penrose, has composed a problem devised "to defeat an artificially intelligent (AI) computer but be solvable for humans". The latter are asked to submit their solutions and share their reasoning. But the position itself and the logic behind the experiment is not compelling. Still, you may enjoy checking it with your chess engine.
Chess Festival Prague 2025 with analyses by Aravindh, Giri, Gurel, Navara and others. ‘Special’: 27 highly entertaining miniatures. Opening videos by Werle, King and Ris. 10 opening articles with new repertoire ideas and much more. ChessBase Magazine offers first-class training material for club players and professionals! World-class players analyse their brilliant games and explain the ideas behind the moves. Opening specialists present the latest trends in opening theory and exciting ideas for your repertoire. Master trainers in tactics, strategy and endgames show you the tricks and techniques you need to be a successful tournament player! Available as a direct download (incl. booklet as pdf file) or booklet with download key by post. Included in delivery: ChessBase Magazine #225 as “ChessBase Book” for iPad, tablet, Mac etc.!
Winning starts with what you know The new version 18 offers completely new possibilities for chess training and analysis: playing style analysis, search for strategic themes, access to 6 billion Lichess games, player preparation by matching Lichess games, download Chess.com games with built-in API, built-in cloud engine and much more.
Have you always wanted to play the Sicilian as Black, but been discouraged by the abundance of options for White? Here is the solution to becoming a lifelong successful Sicilian player!
€39.90
The story was broken by Sarah Knapton, Science Editor of The Telegraph, who put it up in her newspaper. In it she reported on the launch of the new Penrose Institute, founded by mathematics professor Sir Roger Penrose, who gained world-wide renown in 1988 by working out black hole singularities together with Stephen Hawking (the two received the Wolf Prize in Physics for that). I was unable to find the original chess artical on the Penrose Institute site, but Sarah Knapton quotes extensively from it:
The chess problem – originally drawn by Sir Roger – has been devised to defeat an artificially intelligent (AI) computer but be solvable for humans. The Penrose Institute scientists are inviting readers to work out how White can win, or force a stalemate, and then share their reasoning. The team then hopes to scan the brains of people with the quickest times, or interesting Eureka moments, to see if the genesis of human ‘insight’ or ‘intuition’ can be spotted in mind.
Can you solve the puzzle?
You can move the pieces to analyse on the board
Scientists from the Penrose Institute want to hear from you if you've cracked it. They write:
The puzzle above may seem hopeless for White, with just a king and four pawns remaining, but it is possible to draw and even win. Scientists have constructed it in a way to confound a chess computer, which would normally consider that it is a win for Black. However an average chess-playing human should be able to see that a draw is possible.
A chess computer struggles because it looks like an impossible position, even though it is perfectly legal. The three bishops forces the computer to perform a massive search of possible positions that will rapidly expand to something that exceeds all the computational power on planet earth.
Humans attempting the problem are advised to find some peace and quiet and notice how the solution arises. Was there a flash of insight? Did you need to leave the puzzle for a while and come back to it? The main goal is to force a draw, although it is even possible to trick black into a blunder that might allow white to win.
The first person who can demonstrate the solution legally will receive a bonus prize. Both humans, computers and even quantum computers are invited to play the game and solutions should be emailed to puzzles@penroseinstitute.com.
It’s hard to imagine how the game got here—it's even harder to imagine what happens next, let alone a scenario in which four white pawns and a white king could play to a draw, or even win this game. Yet: scientists at the newly-formed Penrose Institute say it’s not only possible, but that human players see the solution almost instantly, while chess computers consistently fail to find the right move.
“We plugged it into Fritz, the standard practice computer for chess players, which did three-quarters of a billion calculations, 20 moves ahead," explained James Tagg Co-Founder and Director of the Penrose Institute, which was founded this week to understand human consciousness through physics. "It says that one side or the other wins. But," Tagg continued, "the answer that it gives is wrong."
True. Above is the calculation displayed by the oldest engine I have installed on my notebook. Fritz 13 scores the position as 31.72 pawns ahead for Black. On ChessBase India Sagar Shah checked it out with Houdini 5.01 Pro 64 bit, down to 34 ply in a four-line search. Result: 24.91 pawns ahead for Black.
It is true that chess engines will display high scores in favour of Black, due to the material advantage of a queen, two rooks, three bishops and a pawn. What they are saying is that Black has a huge material advantage, one that should result in a win (–+). And they will keep moving their bishops, displaying a high positive evaluation right until the 50-move rule approaches and they see there is no possibility of forcing a pawn move by White. Maybe some of our readers can play out the position and tell us when top engines see the futility of continuing to move and display an eval = 0.00.
Interestingly, when I remove two black bishops my ancient Fritz 13 sees the draw in mere seconds. If I remove just one bishop it does not come up with a 0.00 evaluation in a reasonable amount of time.
But now we come to the humans, who can indeed work things out in a flash: the position is extremely contrived, and so the first thing you do is work out that Black has no legal moves except with his bishops. All White needs to do to defend the position is not to capture a black rook and not move the c6-pawn. He simply moves his king around, mainly on the white squares, and lets Black make pointless bishop moves. Absolutely nothing can go wrong. Once again we ask the owner of very old chess engines to check whether any of them will capture a rook, in order to reduce the material disadvantage slightly – but in the process lose the game.
On the other hand the contention that "it is even possible to trick Black into a blunder that might allow White to win" seems extremely far-fetched. Black would need to move his bishops out of the way, while White advances his king to protect the c-pawn, which then promotes (e.g. 1.Kf3 Be1 2.Ke4 Bc1 3.Kd5 Ba1 4.Ke6 Bec3 5.c7 Kb7 6.Kd7 Bf4 7.c8=Q#), but that is not White tricking Black, it is some kind of pointless helpmate.
Anyway, it is trivially easy for White to hold the draw, and the Penrose Institute will probably receive hundreds of correct solutions submitted by average chess players. The scientists say they are interested in the thought process that lead people to the solution – a sudden moment of genius, or the result of days of consternation? "If we find out how humans differ from computers, then it could have profound sociological implications," Penrose told The Telegraph. Really?
There are much more elegant positions and more profound examples that show the difference between human and computer thinking. Back in March 1992 I published the following study in a computer magazine, as a challenge for any machine to get it right:
You probably know that you can switch on an engine on our JavaScript board (and move pieces to analyse). You can maximize the replayer, auto-play, flip the board and even change the piece style in the bar below the board. At the bottom of the notation window on the right there are buttons for editing (delete, promote, cut lines, unannotate, undo, redo) save, play out the position against Fritz. Hovering the mouse over any button will show you its function.
Fritz & co. display an eight-pawn disadvantage for White. The correct first move is to sacrifice even more material, which is the only way to secure a draw. This is a much more relevant test, as chess engines, playing the white side, will actually select the wrong strategy and lose the game. In the Penrose position computers think that White is losing, but they will hold the draw without any problem (I say this without having tested older engines and trying to entice them into capturing a rook and losing the game).
This little recreational pastime of taking the mickey out of chess playing computers has a long history, which will be told at a later stage. I must admit: it is getting harder and harder as these things get stronger and stronger.
Frederic FriedelEditor-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.
Computers do not program themselves, not so far. The above examples only prove human-laziness from the engine programmers in including such criteria into the evaluation function. They are extremely corner cases, with almost no practical use. In no way or form these cases put into question that the search-evaluate process that computers use, at always growing performance rates, has widely surpassed the threshold where they are able to defeat the the human chess-playing approach, based mostly on pattern recognition, reasoning and limited "calculation".
saivishwesh 3/16/2017 05:17
i don't think white can ever force a stalemate let alone a checkmate...how will white force a stalemate if black places one of his bishop on c7 and keeps moving the g3 bishop between h2 and g3...??
cythlord 3/16/2017 05:05
The proof of a legal position is trivial: black needs six captures and white has no pieces left. By all means it is a stupid problem. Here's a sample game: [Event "?"]
[Site "?"]
[Date "????.??.??"]
[Round "?"]
[White "?"]
[Black "?"]
[Result "*"]
[PlyCount "118"]
I struggle with even the most basic of retro problems, but this one was so easy I'm not sure it even qualifies as a retro problem.
pmousavi 3/16/2017 05:02
"You insist that there is something a machine cannot do. If you will tell me precisely what it is that a
machine cannot do, then I can always make a machine which will do just that!" Jon Von Neumann
Frederic 3/16/2017 02:44
@benedictralph: you nailed a point that I could have made: chess playing computers are not programmed to deal with such problems since the corresponding positions NEVER occur -- in normal games, as opposed to very abstruse artificially constructed positions, that are presented for pure entertainment. To get a program to consider completely locked positions would indeed be quite easy, but in the end it would probably not add a point of playing strength in regular games. Well, maybe a few, but they would be cancelled by the time spent checking every position for blockages.
PEB216 3/16/2017 02:41
A fascinating problem if we accept the challenge posed in the third paragraph of this article: ". . . workout how White can win, or force a stalemate." I couldn't see a win for White (not strictly true), but I did see the possibility for a "stalemate," although, unfortunately, it doesn't work. Here is my idea: Place the White King on c8 and the White Pawn on c7. With the threat Kb8 (with the idea Ka8 followed by c8(Q) and mate). If, after Kb8, Black responds with Bxc7+, then Ka8. Now White threatens a "stalemate" (if Black cooperates!) as follows: b3xa4, Qxa4; c4xb5+, Qxb5?? (of course, this is a blunder; the right move is Kxb5) stalemate. If Black plays Bxc7 (when the White King is still on c8), then play continues as previously: b3xa4, Qxa4; c4xb5+ Qxb5?? (Kxb5 is the correct move) stalemate.
sagitta 3/16/2017 12:21
This is shockingly stupid for a maths professor - I would guess that anyone rated above 1000 would see that it is a draw in a second or two
benedictralph 3/16/2017 10:16
A computer could easily be programmed to solve *this type* of problem, if need be. Just like it can be programmed to do any number of other specific things. The problem "proves" nothing except that most chess programs are not coded in the right way to solve it. Indeed they are coded to play strong chess and this usually comes at the expense of dealing with "exotic" positions that are virtually impossible to occur in a real game.
deepestgreen 3/16/2017 10:08
presumably those that created this problem aren't really chess players. its so obvious, there isn't any thought process required.
Tom Box 3/16/2017 09:08
For the Rudolph problem, Stockfish does not follow the line given above but recommends 1..b3. One of the simplest positions that shows a chess engine does not 'understand' but only calculates is a board divided by a wall of pawns of both colour with a king on one side and king and queen on the other. A child immediately sees that the separation is total and the 'superior' side's extra queen is meaningless, while the engine sees the position as winning for the side with the queen.
How do you play the Queen's Gambit Accepted? Does White have promising variations or can Black construct a water-tight repertoire? The Powerbook provides the answers based on 300 000 games, most of them played by engines.
The Queen's Gambit Accepted Powerbase 2025 is a database and contains a total of 11827 games from Mega 2025 and the Correspondence Database 2024, of which 240 are annotated.
Rossolimo-Moscow Powerbase 2025 is a database and contains a total of 10950 games from Mega 2025 and the Correspondence Database 2024, of which 612 are annotated.
The greater part of the material on which the Rossolimo/Moscow Powerbook 2025 is based comes from the engine room of playchess.com: 263.000 games. This imposing amount is supplemented by some 50 000 games from Mega and from Correspondence Chess.
€9.90
We use cookies and comparable technologies to provide certain functions, to improve the user experience and to offer interest-oriented content. Depending on their intended use, analysis cookies and marketing cookies may be used in addition to technically required cookies. Here you can make detailed settings or revoke your consent (if necessary partially) with effect for the future. Further information can be found in our data protection declaration.
Pop-up for detailed settings
We use cookies and comparable technologies to provide certain functions, to improve the user experience and to offer interest-oriented content. Depending on their intended use, cookies may be used in addition to technically required cookies, analysis cookies and marketing cookies. You can decide which cookies to use by selecting the appropriate options below. Please note that your selection may affect the functionality of the service. Further information can be found in our privacy policy.
Technically required cookies
Technically required cookies: so that you can navigate and use the basic functions and store preferences.
Analysis Cookies
To help us determine how visitors interact with our website to improve the user experience.
Marketing-Cookies
To help us offer and evaluate relevant content and interesting and appropriate advertisement.