ez4u wrote:Wasiqi wrote:...
I'm reminded of this article
http://en.chessbase.com/home/TabId/211/PostId/4008047
...
Amazing article! Thanks for posting this link.[Emphasis added]The posted article - 'Rajlich: Busting the King's Gambit, this time for sure' wrote:
How much processing time went into your project?
Approximately – well actually quite precisely – 10,750,000 hours of single-core CPU time. The King's Gambit run took a little over four months in total, elapsed time, to calculate.
That was on about 3000 cores, right? What was the system doing?
...
Will this take all of the creativity and flexibility out of opening play?
Quite the opposite. I think players will see that many surprising moves are playable, giving them more options to choose from. For example, take the game Topalov-Kramnik from Wijk aan Zee 2008. The genius of Topalov's preparation wasn't that 12.Nxf7 is some sort of great move. It was simply realizing that 12.Nxf7 is playable and doesn't lose by force. Once you establish that, it's not that hard to work out a way to put a ton of pressure on your opponent.
...
Okay, cough it up: what next?
I say this with some apprehension, but we've been looking at the 6.Bg5 Najdorf (10.e5! looks promising as a forced win for White). But if we decide to do the full classification we are going to need much faster hardware. Maybe a factor of a thousand over what we used for the King’s Gambit. There are companies that periodically test that kind of hardware for new server parks, and run very CPU-intensive applications on them to locate faulty processors. We have made contact with the technical director of the Google server farms, who was definitely interested. So maybe in a year or two we will have solved the Najdorf.
...
Unfortunately, this was apparently an April Fool's joke.