Deep Blue - Implemented Model
The chess-playing computer Deep Blue—an IBM parallel computer running 256 chess processors allowing it to consider 50-100bn moves in three minutes—beat world champion Garry Kasparov in two out of 6 games at a match in 1996.

In addition to deep search of possible moves, Deep Blue consults a database of opening games and endgames played by chess masters over the last 100 years.

Deep Blue's success is based on engineering rather than emulation. Even if it doesn't think like a human, it is relevant to business applications that require rapid management of large amounts of data.

Deep Blue is the descendent of earlier work by graduate students at Carnegie Mellon University.

Feng-hsiung Hsu, Thomas Anantharaman, Murray Campbell, and Andreas Nowatzyk (1990)and IBM (1998).

CONTEXT(Help)
-
Artificial Intelligence »Artificial Intelligence
Can computers think? [1] »Can computers think? [1]
Yes: physical symbol systems can think [3] »Yes: physical symbol systems can think [3]
The Heuristic Search Assumption »The Heuristic Search Assumption
Computers play expert chess using heuristic search »Computers play expert chess using heuristic search
Deep Blue - Implemented Model
+Comments (0)
+Citations (0)
+About