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 the only game in the match that Black won. "February 17". The sixth game was an illustration of just how badly computers can play in some positions. Employing anti-computer tactics and keeping the focus of the game on long-term planning, Kasparov slowly improved his position throughout the mid-game while Deep Blue wasted time doing nothing. By the end of the game, Deep Blue's pieces were crammed into its queenside corner, with no moves to make aside from shuffling its king. Kasparov had all the time in the world to finish the rout. Kasparov's next move would probably have been 44.Qe7