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.

About 3 min6 interactive slides · 5 questionsLesson 411 · Zone 46

Play this lesson

Free to play in your browser or on iPhone

More in this zone

  1. 406PuzzlesThe Knight's TourCan a knight visit every square exactly once?
  2. 407Programming ConceptsThe Recursion MirrorA problem can be solved by a smaller copy of itself
  3. 408Group TheoryRubik's Cube: 43 Quintillion PositionsEvery position can be solved in 20 moves or fewer
  4. 409Mobile NetworksThe Invisible HandoffYour phone changes towers mid-call without you noticing
  5. 410Digital ImagingDitheringHow old images faked colors they didn't have
  6. 412Game AIMove 37AlphaGo played a move experts called a mistake, and it won
  7. 413Matching MarketsThe Matchmaking Algorithm That Won a NobelIt places doctors in hospitals and students in schools
  8. 414Additive ManufacturingThe 3D-Printed LatticeEmpty space can make a part lighter without making it weaker