Could a modern chess engine on a Pentium have defeated Kasparov in 1996?
0 comments · games, retrocomputing
- Comments8
0 comments · games, retrocomputing
Story details from Lobsters ↗ · linked article on nicholas.carlini.com.
Could a modern chess engine on a Pentium have defeated Kasparov in 1996? was first seen on Lobsters · Hottest on Nov 3, 2026. Since then it has appeared in 84 checks on 3 different days. Its best position was #3 of 25, reached on Nov 3, 21:51 UTC. It dropped off the list after Nov 5, 09:21 UTC. The same link also trended on Hacker News, which raises its cross-platform score.
Position on Lobsters · Hottest at every check (lower is better).
Best rank per day (UTC).
Platform metric as reported by Lobsters.
| List | Best | Days | Checks | Last seen |
|---|---|---|---|---|
| Lobsters · Hottest | #3 | 3 | 84 | |
| YHacker News · Front page Could a modern chess engine on a Pentium have defeated Kasparov in… | same link | |||
A few top-level comments from Lobsters, shortened. Read the full thread on Lobsters.
And sometimes, amusingly, the opposite. There are at least a few examples of "surprisingly advanced" algorithms that were invented in the 1960s and then forgotten because nobody had the entire _megabytes_ of RAM that would have been needed to put them into production. Then they stayed forgotten until the 2000s or so…
This is awesome, and it has me wondering what the most minimal system that could defeat a GM would be.
Interesting! It's easy to get the perception that "new algorithms are better but too complex for older devices which is why they weren't used", but it turns out that sometimes new algorithms are just always better haha
Archived daily, weekly and monthly lists that include this entry.
Not at the moment. It was last on the list on Nov 5, 09:21 UTC, after 3 days of trending.
#3 on Lobsters · Hottest, on Nov 3, 21:51 UTC. Trendoday checks this list every 30 minutes.
It was first seen on Nov 3, 2026 and has been on the list on 3 days (84 checks) since.