Editing Computer chess (section)

=== Microcomputer revolution ===
Technological advances by orders of magnitude in processing power have made the brute force approach far more incisive than was the case in the early years.  The result is that a very solid, tactical AI player aided by some limited positional knowledge 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 [[IBM Deep Blue|Deep Blue]], a brute-force machine capable of examining 500&nbsp;million nodes per second, defeated World Champion Garry Kasparov, marking the first time a computer has defeated a reigning world chess champion in standard time control.