Computer chess built in by the evaluation function and pruning/extension rules began to match the best players in the world. It turned out to produce excellent results, at least in the field of chess, to let computers do what they do best (calculate) rather than coax them into imitating human thought processes and knowledge. In 1997 Deep Blue defeated World Champion Garry Kasparov, marking the first time a computer has defeated a reigning world chess champion in standard time control. Computer chess programs consider chess moves as a game tree. In theory, they examine all moves, then all counter-moves to those moves,
Deep Blue versus Garry Kasparov to exchange the queens. That would have allowed his pawn, which was about to promote, to advance. "May 3". The 1997 rematch began with the King's Indian Attack, which led Kasparov to victory in 45 moves. Deep Blue's 44th move in this game puzzled Kasparov, and he attributed it to "superior intelligence". Allegedly, the move was a result of a bug in which Deep Blue, unable to determine a desirable move, resorted to a fail-safe. Nate Silver proposes that Kasparov "concluded that the counterintuitive play must be a sign of superior intelligence", leading him to lose the second game. "May