“Could a modern chess engine on a Pentium have defeated Kasparov in 1996?”
On February 10th, 1996, a computer program (IBM’s Deep Blue) defeated the reigning chess champion (Garry Kasparov) in a game of chess for the first time. Deep Blue would go on to lose the match, but a year later, would get its revenge in a 3.5-2.5 rematch.
In order to achieve this feat, IBM spent several million dollars on research and development building a special-purpose computer specifically for this purpose. Deep Blue itself (the victorious, upgraded version) was powered by 30 P2SC processors each running at roughly 120 MHz, and (most importantly) 480 custom VLSI chess co-processors used to perform chess-specific operations like move generation and position evaluation. When it was built, Deep Blue was the 259th most powerful supercomputer in the world, and could analyze over 200 million chess positions per second. […]
Skill in chess is measured by an Elo score. […] The best chess engines that you could run on commodity 1996 hardware were rated roughly 2300 Elo. Deep Blue was rated 2700. In contrast, modern Stockfish is rated closer to 3700.
This raises the question: how much of the advantage of a modern chess engine comes down to the fact that a modern desktop computer is extremely fast, and how much of the advantage comes down to the fact that we’ve just gotten better at programming chess engines?
This post by Nicholas Carlini is a more technical post than I usually share in this neck of the woods, but I wanted to to this for this ending:
The first time we humans do anything, we rarely do it efficiently. Once we see a path that would clearly work if only we scaled it up, we do just that. Only later, after we’ve had the time to better understand the problem at hand, do we come to recognize that we could have achieved the same feat much more efficiently by being clever.
I mostly did this for fun, because whether I could have beaten Kasparov with commodity hardware sounded like a fun question to answer, but I also hoped it would provide a tiny bit of insight into the rate of algorithmic progress in “AI”. Chess engines in 1997 were already quite advanced; after all, Alan Turing helped write the first chess program nearly fifty years earlier. So I suppose at the time it seemed plausible that maybe there weren’t that many more ideas left to find. And with hindsight it’s easy to see that’s wrong.
This is interesting to me less in the AI context, but more in the “people getting better at understanding and programming things” sense.
It reminds me of Racing the Beam, a fun 2009 book by Ian Bogost and Nick Montfort, chronicling the life of a certain Atari 2600 videogame console, released in 1977. The console predates me, although it has been on the market for many years. Toward the end of its life, the programmers understood it so well and were so much in sync – literally and figuratively – with its antiquated hardware, they made games with graphics so great they seemed to belong to the next generation of hardware. I am pretty sure if you were to grab some mid-1980s Atari 2600 games and go back in time to 1977, the creators of the console itself would tell you these were not possible to make.
This is an 1977 launch title Combat, followed by the famous Pitfall! from 1982. I know they will both look primitive from the flattened perspective of today, but believe me – Pitfall! was a masterpiece that inspired a generation: