![]() The best computer chess programs, vastly more efficient than Deep Blue, combined with modern CPUs which are now finally within an order of magnitude of what Deep Blue's specialized chess hardware could deliver, play at levels way beyond what humans can achieve.Ĭhess: ruined forever. This is in contrast to supercomputers such as Deep Blue that searched 200 million positions per second.Īs far as chess goes, despite what I so optimistically thought in 2006, it's been game over for humans for quite a few years now. Pocket Fritz 4 searches fewer than 20,000 positions per second. ![]() In 2009 a chess engine running on slower hardware, a 528 MHz HTC Touch HD mobile phone running Pocket Fritz 4 reached the grandmaster level – it won a category 6 tournament with a performance rating of 2898. Greatly improved chess programs running on mere handheld devices can perform beyond grandmaster level. I am not sure the scaling is exactly linear, but it's fair to say that even now, twenty years later, a modern 8 core CPU is still about an order of magnitude slower at the brute force task of evaluating chess positions than what Deep Blue's specialized chess hardware achieved in 1997.īut here's the thing: none of that speedy brute forcing matters today. An eight core CPU, no longer particularly exotic, could probably achieve ~28 million on this benchmark today. Not bad! Part of that is I went from dual to quad core, and these chess calculations scale almost linearly with the number of cores. Stockfish chess make ai faster Pc#Today, about twenty years later, that very same benchmark says my PC can evaluate a mere 17.2 million chess positions per second. In 2006, about ten years later, according to the Fritz Chess benchmark, my PC could evaluate only 4.5 million chess positions per second. Even though one of its best moves was the result of a bug. And that was enough to defeat Kasparov, the highest ever ranked human player – until 2014 at least. How many orders of magnitude? In the heady days of 1997, Deep Blue could evaluate 200 million chess positions per second. The number of possible moves, or "problem space", of Chess is indeed astonishingly large, estimated to be 10 50:ġ00,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000ĭeep Blue was interesting because it forecast a particular kind of future, a future where specialized hardware enabled brute force attack of the enormous chess problem space, as its purpose built chess hardware outperformed general purpose CPUs of the day by many orders of magnitude. Turns out I was kinda … totally completely wrong. The problem space of chess is so astonishingly large that incremental increases in hardware speed and algorithms are unlikely to result in meaningful gains from here on out. In 2006, after visiting the Computer History Museum's exhibit on Chess, I opined: Thanks For Ruining Another Game Forever, Computers ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |