6/27/2012 – That is the title of a Huffington Post story on an historic encounter during the Turing Centenary Conference in Manchester last weekend. After his lecture on the reconstruction of the Turing "Paper Machine" for chess Garry Kasparov actually played a game against the reconstructed version of the machine, which you can download and test yourself. We have video reports and the moves of the game.
new: Fritz 20
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.
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.
Learn from legends! Get the full Master Class series on the World Champions at a discounted bundle price – only for a limited time.
€399.90
The Turing Centenary Conference was held in Manchester on June 22-25, 2012, hosted by the University of Manchester, where Turing worked in 1948-1954. The conference had the following aims:
to celebrate the life and research of Alan Turing;
to bring together the most distinguished scientists, to understand and analyse the history and development of Computer Science and Artificial Intelligence.
There were a large number of interesting speakers and dignitaries at the Turing Centenary, including many Turing Award winners. You can find a list of their lectures here. One of the speakers was former World Chess Champion Garry Kasparov, who described a project that reconstructed Turing's "Paper Machine".
It is an amazing fact, Kasparov told a packed audience (at 09:00 a.m.!), that the very first chess program in history was written a few years before computers had been invented. It was designed by a visionary man who knew that programmable computers were coming and that, once they were built, they would be able to play chess. The man, of course, was Alan Turing, one of the greatest mathematicians who ever lived. Soon after the war he wrote the instructions that would enable a machine to play chess. Since there was as yet no machine that could execute the instructions he did so himself, acting as a human CPU and requiring more than half an hour per move. A single game is recorded, one in which Turing's "paper machine" lost to a colleague.
Kasparov sketched the historical context of Turing’s involvement in chess and then went on to describe how chess computer experts had reconstructed the paper machine to run on a modern day computer. The lecture was streamed live on the Internet. We will provide a link plus a full transcript and pictures in a special report this weekend.
Turing vs Kasparov
At the end of the lecture Kasparov took part in an historic encounter: he played the first public game by a chess professional against the reconstructed Turing Paper Engine.
Video report of the historic encounter
Garry Kasparov during his lecture at the Turing Centenary
Preparing to play the original Turing engine, operated by Frederic Friedel of ChessBase
Kasparov and Friedel during the game – the engine has just lost a piece to a pawn fork
Here is the games for replay. We had the Turing engine evaluate the moves, at five seconds a move, i.e. with a deeper search than when it played Kasparov. The evaluations are displayed in the graph below the board. Note that, due to the way this engine works, the values are only for the positional criteria, not material. Also that the engine has very different opinions, depending from which side it is looking at the board.
[Event "Manchester, 2 Ply"] [Site "Hamburg"] [Date "2012.06.25"] [Round "?"] [White "Turing"] [Black "Kasparov, Garry"] [Result "0-1"] [ECO "A00"] [PlyCount "32"] [EventDate "2012.??.??"] 1. e3 {-4.40/6} Nf6 {3.00/6} 2. Nc3 {-3.30/6} d5 {1.80/5} 3. Nh3 {-2.60/5} e5 { 1.70/4} 4. Qf3 {-2.50/4} Nc6 {1.10/4} 5. Bd3 $4 {0.10/4 At two ply the engine cannot see the coming fork.} ({At five ply it plays} 5. a4) 5... e4 {-0.20/4} 6. Bxe4 {-2.00/4} dxe4 {-1.00/4} 7. Nxe4 {-1.50/4} Be7 {1.10/5} 8. Ng3 {-2.30/4 } O-O {1.70/4} 9. O-O {-2.20/4} Bg4 {-0.10/4} 10. Qf4 {-1.50/4} Bd6 {0.90/4} 11. Qc4 {-2.00/4} Bxh3 {0.20/4} 12. gxh3 {-2.40/4} Qd7 {-0.30/4} 13. h4 {-1.10/ 4} Qh3 {0.10/4} 14. b3 $2 {-0.60/4} ({When it calculates five ply the Turing engine plays} 14. f3 {preventing the next black move.}) 14... Ng4 {-0.70/4} 15. Re1 {-#2/4 Allowing mate in two.} ({Again five ply produces a different move, one that prevents an immediate mate:} 15. Qxg4) 15... Qxh2+ {-#1/6} 16. Kf1 { -#1/4} Qxf2# 0-1
Kasparov on the Turing Paper Machine and the game he has just played against the reconstructed version
In this video interview Garry excuses the machine for its 16-move loss, saying we must remember that it was set at only two ply. He is full of praise for Turing's research and his chess program: “I suppose you might call it primitive, but I would compare it to an early car – you might laugh at them but it is still an incredible achievement. He wrote algorithms without having a computer – many young scientists would never believe that was possible. It was an outstanding accomplishment. Although it’s only thinking two moves ahead, I would have thought it would give the amateur player some serious problems. Alan Turing is one of the very few people about who you could say that if he had lived longer the world would be a different place.”
We can reveal that on the previous evening Kasparov played two practice games in his room against the engine, set at five ply. It lasted 27 and 30 moves against him.
Download the Turing Engine
You can experiment with the Turing Engine yourself. It runs under Fritz or any Fritz-complatible program (Rybka, Hiarcs, Junior, etc.) and can also be operated as an engine in the ChessBase program.
To download the engine click on "Service and Download" on the top of our newspage
Now select "Engines" in the download dropdown menu
At the bottom of the engine download page you will find the Turing engine. Download the file, run it and the engine will be installed in the ChessBase directory of your hard disk. It can be selected like any other program. The entire installation of the engine takes just one or two minutes.
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.
Focus on the Sicilian: Opening videos on the Najdorf Variation with 6.h3 e5 7.Nb3 (Luis Engel) and the Taimanov Variation with 7.Qf3 (Nico Zwirs). ‘Lucky bag’ with 38 analyses by Anish Giri, Surya Ganguly, Abhijeet Gupta, Yannick Pelletier and many more.
€14.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.