Deep Blue Defeats World Chess Champion
11 May 1997Artificial intelligenceMajor incidentDate precision, exactEvidence grade, primary1 primary source
Drivers:
Advances in hardware enabled deeper search. Decades of chess programming research refined evaluation functions. IBM invested significant resources in pursuit of the high-profile goal.
In 1997, a computer called Deep Blue beat the world chess champion, Garry Kasparov. This was huge news because chess was seen as a game requiring human intelligence and creativity. Deep Blue won by calculating millions of possible moves every second, something no human could do. It showed that computers could outperform humans at complex thinking tasks.
Deep Blue Defeats World Chess Champion event plate
Structured atlas record showing date, domain, evidence grade, source count, and predecessor and successor links.
Forecasts and counterfactuals stay labelled as opinion in the event data. Source: Computer History Museum.
Before
Chess had been considered a benchmark for machine intelligence since the field's inception. Despite decades of progress, no computer had defeated a reigning world champion in a match. Many believed human intuition and creativity gave an insurmountable advantage.
What changed
IBM's Deep Blue defeated Garry Kasparov, the reigning world chess champion, in a six-game match. This was the first time a computer beat a world champion under standard tournament conditions. The victory demonstrated that machines could outperform humans in complex cognitive tasks.
How it happened
Deep Blue was a specialised chess computer capable of evaluating 200 million positions per second. It used alpha-beta search with sophisticated evaluation functions refined by grandmasters. After losing to Kasparov in 1996, the team improved both hardware and software. The 1997 rematch ended 3.5-2.5 in Deep Blue's favour.
Outcomes
- Demonstrated AI could exceed human performance in complex domains
- Raised questions about nature of intelligence and creativity
- Established benchmark for AI achievements
- Showed value of combining search with domain expertise
Limitations
- Narrow AI: Deep Blue could only play chess
- Brute force approach rather than human-like reasoning
- Required specialised hardware
- Did not generalise to other problems
Lessons learnt
- Specialised systems can exceed human performance in narrow domains
- Brute force with good heuristics can be powerful
- AI milestones shift goalposts of 'true intelligence'
- Public demonstrations shape perception of AI progress
Stakeholders and artefacts
Organisations
- IBMvendorDeveloped Deep Blue
Individuals
- Garry KasparovOpponent, IndependentWorld chess champion defeated by Deep Blue
- Feng-hsiung HsuLead engineer, IBMChief architect of Deep Blue
- Murray CampbellResearcher, IBMDeep Blue team leader
Artefacts
- Deep BluehardwareIBM chess-playing supercomputer
- Alpha-beta pruningmethodologySearch algorithm optimisation
Key terms
Causality
Preceded by: Backpropagation Enables Multi-layer Neural Networks.
Made possible: AlexNet Wins ImageNet: Deep Learning Revolution Begins.
On this course
Read in the path AI: From Turing to Transformers.