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 Kasparov, 1997, Game 6 first time that a computer had defeated a World Champion in a match of several games. This, as well as the fact that Kasparov had lasted only 19 moves in a game lasting barely more than an hour, attracted much media attention. White: Deep Blue Black: Garry Kasparov Opening: Caro–Kann Defense, Steinitz Variation ("ECO" B17) 1. e4 c6 2. d4 d5 3. Nc3 dxe4 4. Nxe4 Nd7 5. Ng5 (see diagram) 5... Ngf6 6. Bd3 e6 7. N1f3 h6? (see diagram) 8. Nxe6! 8... Qe7 9. 0-0 9... fxe6 10. Bg6+ Kd8 11. Bf4 (see diagram) 11... b5? 12. a4