AI & Machine LearningGame AI
Deep Blue vs Kasparov
In 1997 a computer beat the world chess champion
In 1997 a machine beat the world chess champion without ever learning a thing. So how did it win?
You'll find out
- How does a computer look ahead?
- How many positions in one second?
- Why couldn't this trick win at Go?
Why it matters
Brute-force search wins when choices are few. When they explode, as in Go, machines need another way.
Play this lesson
Free to play in your browser or on iPhone