Could a modern chess engine on a Pentium have defeated Kasparov in 1996?

nicholas.carlini.com

494 points by markusw 4 days ago


k2052 - 4 days ago

The main point the post is trying to make is accurate, modern chess engines are stronger mostly due to improved eval, search, etc and not hardware; but the idea that Kasparov would lose to one on 90s hardware is not as clearly true as one might think. Modern engine eval functions and search algos make very different depth tradeoffs and when given not enough compute they have glaring weaknesses that Kasparov and his team would likely have exploited.

It was trivial for me an expert-ish player (1950 USCF 2300+ bullet) to find a line to beat it. https://nicholas.carlini.com/writing/2026/algorithmic-improv...

Also 3000 engine elo is not really a good direct comparison, engine elos are kinda meaningless when comparing human to engines, they are meant to compare engines to engines.

A lot of the knowledge tricks that modern engines do require depth or other things that didn't work on older hardware, deep blue was engineered to brute force a lot of things because brute force in the 90s worked better. Historically all sorts of things were tried for chess engines abandoned and tried again. Chess engine dev (and AI in general) is very cyclical; old ideas get returned to and retried as the hardware changes and evolves. Devs from past eras were smarter and more knowledgeable than we give them credit for. Heck, some of the very first engines for checkers and chess were neural nets (of a sort).

tombert - 4 days ago

Very tangential, but I think a lot about how modern video compression has gotten so unbelievably good that if we went back in time with AV1 or HEVC or something, I'm wondering if we could have had passable video streaming at 240p with something like an ISDN connection.

It would be a tight fit, but I still think within feasibility. We've gotten so good at shrinking video that it kind of feels like wizardry to me. Granted, I'm not sure there existed a computer in the 90s that was powerful enough to encode or decode it.

FartyMcFarter - 4 days ago

Awesome article. Nit:

> the average chess grandmaster during a classical game will analyze roughly the same number of moves as an amateur player, but they analyze only the most critical moves and do a better job with that analysis.

I don't buy this. I've seen GMs playing online while verbalizing their thought process (on twitch / youtube videos where they livestream their play), and they consider way more branches than I do, while also going deeper than I ever would on some branches. My top rating in lichess blitz is about 1900, not bad but way lower than a GM.

Sharlin - 4 days ago

> because who would want to buy a Pentium Pro when the better-in-almost-every-way Pentium MMX

Maybe this was satirizing people running after every shiny new thing, but the MMX certainly wasn’t. The Pro was the first P6, a totally new, out-of-order microarchitecture that the Pentium 2 would be based on. The MMX was a standard P5 Pentium with a larger L1 and the MMX vector instruction set which, while the first of its kind in an x86, was ultimately not used much in applications, partly because it was integer-only (also because it awkwardly co-opted the existing FPU registers rather than having its own register file). In any case, the Pros were expensive and meant for business use, while the MMXs were consumer processors.

rockmeamedee - 4 days ago

Yes but most of it is NNUE, a custom neural network trained on mountains of data to copy modern Stockfish.

So a computer from back then _can_ run at Elo +3k, but the programmers at the time wouldn't have been able to implement it even if you went back with a time machine and the blueprint for the technique. They wouldn't have the teacher model to distill from.

dmurray - 4 days ago

Great project but I have a nit on the board displays: every board is displayed as <human username> vs Pentium Pro, even when the Pentium is playing White. The normal chess convention is <White name> vs <Black name>.

I spent some time trying to figure out how some of the humans seemed to have trapped the machine out of the opening, because it looked like the human was winning.

cousin_it - 4 days ago

I'll go out on a limb and say that future AI models, running on today's smartphones, will be better at programming and formal math than today's frontier models running in datacenters. And by "future" I mean less than 5 years from now.

mb_thd - 4 days ago

> Throughout this article, when I say "I wrote", what I really mean is "I asked an LLM to write".

I wish disclaimers like that would be at the start and not halfway trough the text.

orac81 - 4 days ago

A 100 Mhz Pentium did, in 1994, running ChessGenius in the Intel Grand prix.

https://chessprogramming.org/Chess_Genius

https://www.chessgames.com/perl/chessgame?gid=1070709

glimshe - 4 days ago

Very interesting. I don't play chess but like to observe others playing and talking about it on YouTube.

I thought about something the other day... Modern chess sites run proprietary algorithms to detect cheating by modern engines. But would it be possible for an old engine, let's say from the 70s or 80s, running on modern hardware to deceive these algorithms?

They wouldn't win every tournament but still have a respectable performance.

bentt - 4 days ago

Wonderful work! Just inspiring.

I had a Pentium Pro 200 back in the day, to run 3DSMax 1.0 on Windows NT 3.5.

primitivesuave - 4 days ago

Excellent post. One thing that would be really interesting to see is the "ponder hit rate" (how often two engines pick the same move across a large set of test positions) between your custom Crafty engine and the lineage of engine development over the decade after 1996 (Fruit, HIARCS, Rybka, Stockfish, etc).

Fabien Letouzey released the Fruit engine in 2004, and within six months, HIARCS had its biggest Elo gain in over a decade. No future engine followed the same slow Elo growth curve after that. Similarly, after Vasik Rajlich released Rybka, it pulled 150 Elo ahead of everyone else on the same hardware. So the history of chess engine development certainly supports the theory that a better evaluator can make an exponentially stronger engine on equivalent hardware.

emil-lp - 4 days ago

This is very cool. But yes, totally unsurprising that a megahertz machine with 100MB+ available ram has >2500 ELO.

vhcr - 4 days ago

> As it turns out, the majority of the Elo gains (+720 of the +1335 gained) can be attributed to better programming, and not better hardware.

It's not so easy, a lot of that better programming can be attributed to better hardware, it wouldn't have been possible to implement NNUE or Fishtest without modern hardware.

weinzierl - 4 days ago

I find the general topic of purely algorithmic progress super interesting.

I just ran Andrej Karpathy's Tiny Stories model on a tiny ESP32. In principle we could probably have done this in the 80's and it would have been so amazing.

largbae - 4 days ago

I love this article and I love that LLMs enabled it to exist. The labor cost of software has been setting such tight bounds on creativity and exploration that we will soon wonder why we ever loved to write code.

Sopel - 4 days ago

Cool exploration, and very much needed because depressingly few people who use these engines actually understand this.

Back in 2021 I got cfish and weiss working on a 386sx, though didn't test it much. cfish was doing 5k nps so some results can be extrapolated. NNUE complicated things due to RAM requirements. Though I did train a small one for lichess at some point and they can be surprisingly good.

edit. A good view on the continuous progress of Stockfish itself https://nextchessmove.com/dev-builds

Mr_Minderbinder - 4 days ago

While I do not doubt that that machine would have had good chances against Kasparov, the author throws around various Elo ratings for computers with more authority and certainty than is warranted. The simple fact is we do not have a reliable estimate of how strong Stockfish on a modern desktop is let alone a port of SF to a Pentium Pro machine in terms of FIDE Elo. Every time this subject comes up the various estimates put forward differ by hundreds of Elo points.

> ...because humans don't play against engines very frequently, there can be some small divergences between scores on the FIDE Elo ladder and the CCRL ladder…

This is precisely the problem. There are very few games between FIDE-rated players and CCRL-rated “players” under tournament conditions. The question of what FIDE rating a given CCRL rating would be equivalent to has been analysed extensively before and “small divergences” would be quite the understatement: https://talkchess.com/forum3/viewtopic.php?t=59332

In general ratings obtained purely by computer vs computer play are known to exaggerate the differences between computers compared to their performance against humans. This was known and discussed as far back as the 80s.

Ultimately the only way to discover the true strength of “Pentium Pro-fish” is for it to play a large number of games against FIDE-rated humans under strict tournament conditions.

> But if you happen to know a 2700+ Super GM who wants to try and defeat a 2026 chess engine playing on 1996 hardware, I'd be happy to accept the challenge!

Hikaru Nakamura? Has a history of playing chess computers in various odds matches and it could be interesting “content” for his entertainment brand. But really any of them might be interested if the financial terms were satisfactory.

throwaway81523 - 4 days ago

This doesn't seem to be the same person as The Great Carlini from the Coffee Chess youtube channel, but that's ok, the hacking he did on these chess engines was interesting and he seems to know what he's doing.

I'd have liked to see a backport of something more like Leela, i.e. more human-like evaluation with less search. Leela's neural net is bigger than Stockfish's NNUE but it's slower and static. I heard years ago that Leela searching 35 nodes per move was around equal to a human GM, and it should be much better now that they've redone Leela's NN architecture. My 4-core i5-3570S ran Leela at around 40 nodes/second but I unfortunately don't remember if that used all 4 cores or just one (Leela normally runs on a GPU at 1000s of nps). If the i5 is 100x faster than Carlini's Pentium Pro then that means around 0.4 nps, putting it above GM strength at classical time controls of around 2 minutes per move.

kphorn - 4 days ago

I think there's a super important lesson here for AI. The assumption that Hardware and compute has to scale exponentially to advance the frontier. This is a great example that the density of intelligence in software can scale independent of hardware, greatly extending the useful life and capability of said hardware.

whatshisface - 4 days ago

A lesser known fact about the tournament is that Kasparov played bad chess. The cause was that he decided to practice against software engines that had simple exploitable flaws while Deep Blue was a hardware chess circuit that beat them all by a long way. Kasparov tried the exploits during the match and these were low strength moves in real chess, which he didn't realize he was playing, until too late unfortunately. If Kasparov had played normally he may have won or drawn.

The machine was disassembled shortly after the tournament and Kasparov never accepted the offer to play it again. As a result the true moment where a computer first bested the world champion is not recorded and is likely to have occurred in someone's living room.

zellyn - 4 days ago

When I tried this with a 6502 (Apple II), it did not work. It was just too underpowered for enough modern algorithms to kick in. It might also be an LLm-driving skill issue of course!

https://github.com/zellyn/8fish

fsckboy - 4 days ago

I think the author jumps around a bit in the piece muddying the facts. A 200 MHz Intel Pentium Pro he's talking about had a single core and a supported single thread, so while this may be true of a modern x64 computer:

>Chess engines like Stockfish, running on silicon instead of our human brains, dominate us at the first of these and analyze millions of positions per second.

the 200MHz Pentium Pro he's talking about was capable of 1.5 million instructions per second, which on it's own is not quite millions, and how many instructions would be required to evaluate a position, let's say very optimistically it's 10 for "valid move", now we're at 150k positions per optimistic second.

criddell - 4 days ago

I wonder how far back you can go? Could a modern chess engine run on a Cray 1? 386? 68k?

BobbyTables2 - 4 days ago

Makes me wonder if a modern ESP32 could have beaten him.

Of course, “human vs supercomputer” is more exciting to the public than “human vs toaster controller”, especially when the latter in small quantities costs less than a cup of coffee.

zingar - 4 days ago

Could someone explain to me: are the top chess engines still good examples of the bitter lesson? My very poor understanding of the field is that it’s very algorithmic and not very much like what I think of as AI. But maybe “what I think of as AI” is not a criterion one can use to assess whether the bitter lesson applies.

bjourne - 4 days ago

Why is the time per move fixed? A chess engine can, of course, do much better by deciding itself how much time to allot to each move.

PowerElectronix - 4 days ago

Very cool project. It seems incredible that such a "humble" device for the time would match and beat deep blue. It must be true that software has been living off hardware for a very long time, even if as others comment, the latest developments in software have only been possible after hardware got much much better.

133aagfd - 4 days ago

> I mostly did this for fun

Yeah sure. Anthropic researcher posts a narrative that Moore's law wasn't required to beat Kasparov on consumer hardware just before the IPO. So the improvement roadmap of Anthropic is justified.

This is the same guy that was shilling the underwhelming Mythos model.

- 4 days ago
[deleted]
fergonco - 4 days ago

A modern chess engine would definitely have defeated Kasparov in 1996. It would have had a database containing all the games, particularly that strange game against a computer nobody knew anything about, which seemed to be able to anticipate all of Kasparov's moves.

RicoElectrico - 4 days ago

Polish folk of my vintage probably remember Snikers, a somewhat amusing if not dumb rules based chatbot from 2000s. I wonder what chatbot one could devise that could run comfortably on the hardware of the period, given our advances in NLP.

stevage - 4 days ago

I wonder what the worst hardware that could have beaten Kasparov would have been, since the Pentium seems actually overpowered for the task.

Also interesting that he bothered to buy the physical hardware rather than just simulating it.

hn_submit - 4 days ago

Interesting article. Have we just acquired better insights into programming chess? Are ELO ratings guaranteed to predict whether a machine can beat a human or can a human outsmart a higher ELO rated chess program?

mcksp - 4 days ago

Nice post, thanks.

On a kinda similar note i always wander that about indie video games. We have this massive hits like balatro, vampire survivors, that easily could be made in the era of SNES or N64. But somehow we have to wait 30 years to get them.

It clearly wasn't technical side of things that prevented that, but also I don't believe it was lack of creativity.

Some could argue that it is just what art is, we will get every year some new thing, creating all "possible and meaningful" art right now isn't even valid thing to consider, because art isn't about exhausting a finite set of possibilities.

But at the other hand some mechanics, design solutions in the hindsight seem kinda obvious and make me wonder, what things we do not see now, but will look obvious to people 30 years from now.

mherrmann - 4 days ago

Is an interesting question whether the same will apply to AI models? Not on 1996 hardware, of course. But on 2026 hardware in 2056. Does anybody have any idea / insight?

ForOldHack - 4 days ago

Since you had two chess engines, what was the result of them playing each other?

ur-whale - 4 days ago

Get it to play Magnus, that'd prbly ground the whole affair.

w-m - 4 days ago

> (Also, uh, if anyone has any ideas for projects I could do with a Pentium Pro in a few weeks once I no longer need it to host this chess engine ... do let me know!)

Throw a 3dfx Voodoo in there and do some real-time 3D Gaussian Splatting!

throw315 - 4 days ago

So algorithms beat clock cycles.

- 4 days ago
[deleted]
vagarwal3 - 3 hours ago

[dead]

learntoplaypitc - 4 days ago

[flagged]

3BetLab - 4 days ago

[flagged]

HardHardman2033 - 4 days ago

[flagged]

squidbeak - 4 days ago

Technically interesting but also fanciful bollocks - because there was no Stockfish in 1996, and developing a sufficiently strong equivalent in time for the Deep Blue match would have taken substantially longer that the 18 years the current Stockfish has needed, thanks to the drastically weaker processor capabilities back then.

bell-cot - 4 days ago

In one sense, Knuth fans and really good engineers are correct to prioritize algorithms.

Unfortunately, most humans see big|new|expensive hardware as great status signifiers, barriers to lesser folks joining the Cool Club, and optimal sources of sales commissions.