During development, engineers provided an opening library of moves, added features, improved computation speed and sparred the system against chess grand masters. The 1997 version was capable of searching between 100 and 200 million positions per second, depending on the type of position, as well as a depth of 20 or more pairs of moves. The software carried out the more basic aspects of the chess computations, while the accelerator chips searched through a tree of possibilities to calculate the best moves. Deep Blue was essentially a hybrid, a general-purpose supercomputer processor outfitted with chess accelerator chips.
Big data was in its infancy, and the hardware couldn’t have supported large networks anyway. While certainly AI, Deep Blue relied less on machine learning than current systems do. Deep Blue's chess-playing program was written in C, running under the AIX operating system.ĭuring its rematch with Kasparov in 1997, Deep Blue was capable of evaluating 200 million positions per second, twice as fast as the 1996 version, and was at the time the world’s 259th most powerful supercomputer.By 1997, Deep Blue was sophisticated enough to defeat Kasparov, the reigning world champion. It was a massively parallel, RS/6000 SP Thin P2SC-based system with 30 nodes, each containing a 120MHz P2SC microprocessor enhanced with 480 special purpose VLSI chess chips. The system relied largely on brute force computing power to play chess. Big Blue denied the claims, refused a follow-up rematch and retired the system.ĭevelopment for Deep Blue began in 1985 with the ChipTest project at Carnegie Mellon University. More than a year later in May 1997, Kasparov narrowly lost his six-game rematch against an upgraded version of the machine and went as far as accusing IBM of cheating. IBM's Deep Blue system defeated its first world chess champion on February 10, 1996, when Garry Kasparov lost the first game of a six-game match (he won three and drew the other two games).
0 kommentar(er)
