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,
Reversi game has been particularly attractive to programmers. Therefore, the best Othello computer programs have easily defeated the best humans since 1980, when the program "The Moor" beat the reigning world champion. In 1997, Logistello defeated the human champion Takeshi Murakami with a score of 6–0. Analysts have estimated the number of legal positions in Othello is at most 10, and it has a game-tree complexity of approximately 10. Mathematically, Othello still remains unsolved. Experts have not absolutely resolved what the outcome of a game will be where both sides use perfect play. However, analysis of thousands of high quality games