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 this is nowadays a common tactic, it was a relatively new idea at the time. Despite this anti-computer tactic, the game was drawn. "May 7". In this game Kasparov played the Caro–Kann Defence. Kasparov got into time trouble late in the game. The sub-optimal moves he played in a hurry may have cost him the victory. "May 10". In this game, the King's Indian Attack opening was played. As in the previous game, Deep Blue played a brilliant endgame that secured a draw, when it was looking as if Kasparov would win. If White plays 50.g8=Q then Black can force