Researched
Deep Blue Beats Kasparov
A chess computer with special chips defeats the world champion through raw search power, not understanding.
Open in the interactive tree →In May 1997 IBM’s Deep Blue examined about 200 million positions per second and beat Garry Kasparov 3.5 to 2.5. The success rested on special hardware and hand-tuned chess knowledge. It showed that machines can surpass humans in a narrowly defined domain without any general thinking behind it.
Prerequisites
- Game Theory1944Chess search rests on von Neumann's minimax theorem
- Integrated Circuit1958-1959
- Expert Systems1980
Unlocks
- AlphaGo2016