📜 ⬆️ ⬇️

The program "Fish" decided the royal gambit on April 1

UPD 4.04. The news turned out to be an April Fool's joke ChessBase , which, due to a CMS error, was published on the website on April 2. Even Wikipedia believed it, changing the article about the royal gambit.

By launching the Rybka chess program on an IBM POWER 7 workstation with 2800 cores, the author of the program managed to solve the royal gambit - one of the most difficult and sharp debuts of the chess game, which was actively used by Boris Spassky and Bobby Fisher. The computer program calculated the outcome of all the options for the development of a chess game and came to unexpected results .


')
It turns out that if Black sacrifices on f4, White has only one move, which leads to a draw (in the case of a perfect game on both sides) - an bishop on e2. In all other cases, whites get a checkmate.

IBM POWER 7 with 2,800 cores at 4.25 GHz and 16 terabytes of RAM is about the same equipment that IBM Watson works on, winning over the intellectual quiz.



The calculations took a total of more than four months, which corresponds to 10,750,000 hours on a single CPU.

Curiously, the results of the calculations turned out to be surprisingly similar to the analysis of the royal gambit , made by Bobby Fischer 50 years ago.

Of course, Rybka did not count all the moves in the game until the very end, since the number of options for the development of a chess game (about 10,100 ) is greater than the number of atoms in the universe (from 10,79 to 10,44 ). The program simply evaluates the prospects of the position, and if it receives a sharply negative result, it stops the analysis in this direction. It’s impossible to get out of a very bad position in the ideal game of the enemy with a probability of 99.99999999%, says the program's author Vasik Rajlich.

Source: https://habr.com/ru/post/141309/


All Articles