In the public eye advances in chess-playing computer programs have become symbolic of progress in AI. In 1948 British mathematician Alan Turing developed a chess algorithm for use with calculating machines—it lost to an amateur player in the one game that it played. Ten years later American mathematician Claude Shannon articulated two chess-playing algorithms: brute force, in which all possible moves and their consequences are calculated as far into the future as possible; and selective mode, in which only the most promising moves and their more immediate consequences are evaluated. In 1988 Hitech, a program developed at Carnegie-Mellon Univ., defeated former U.S. champion Arnold Denker in a four-game match, becoming the first computer to defeat a grandmaster. A year later, Gary Kasparov, the reigning world champion, bested Deep Thought, a program developed by the IBM Corp., in a two-game exhibition. In 1990 the German computer Mephisto-Portrose became the first program to defeat a former world champion; while playing an exhibition of 24 simultaneous games, Anatoly Karpov bested 23 human opponents but lost to the computer. Kasparov in 1996 became the first reigning world champion to lose to a computer in a game played with regulation time controls; the Deep Blue computer, developed by the IBM Corp., won the first game of the match, lost the second, drew the third and fourth, and lost the fifth and sixth. Deep Blue used the brute force approach, evaluating more than 100 billion chess positions each turn while looking six moves ahead; it coupled this with the most efficient chess evaluation software yet developed and an extensive library of chess games it could analyze as part of the decision process. Subsequent matches between Vladimir Kramnik and Deep Fritz (2002, 2006) and Kasparov and Deep Junior (2003) have resulted in two ties and a win for the programs. Unlike Deep Blue, which was a specially designed computer, these more recent computer challengers are chess programs that run on powerful personal computers. Such programs have become an important tool in chess, and are used by chess masters to analyze games and experiment with new moves.
See D. Freedman, Brainmakers: How Scientists Are Moving Beyond Computers to Create a Rival to the Human Brain (1994); D. Gelernter, The Muse in the Machine: Computerizing the Poetry of Human Thought (1994).
Ability of a machine to perform tasks thought to require human intelligence. Typical applications include game playing, language translation, expert systems, and robotics. Although pseudo-intelligent machinery dates back to antiquity, the first glimmerings of true intelligence awaited the development of digital computers in the 1940s. AI, or at least the semblance of intelligence, has developed in parallel with computer processing power, which appears to be the main limiting factor. Early AI projects, such as playing chess and solving mathematical problems, are now seen as trivial compared to visual pattern recognition, complex decision making, and the use of natural language. Seealso Turing test.
Learn more about artificial intelligence (AI) with a free trial on Britannica.com.