Algorithms & EmergenceGame AI

The Unbeatable Tic-Tac-Toe

A computer that looks ahead at every move can never lose

You've probably tied at tic-tac-toe a hundred times. Could a machine play so well that you can never beat it?

You'll find out

  • How many games tic-tac-toe really holds
  • How a machine picks its move
  • Why some games are too big for it

Why it matters

The same look-ahead idea runs game AIs everywhere, from chess apps to the bots in your games.

About 3 min6 interactive slides · 5 questionsLesson 204 · Zone 23

Play this lesson

Free to play in your browser or on iPhone

More in this zone

  1. 199TopologyStir Your Coffee: One Point Stays PutHowever you stir, some drop ends where it started
  2. 200Wind EnergyWhy Wind Turbines Have Three BladesNot two, not four: three is the sweet spot
  3. 201Computer ScienceStack OverflowThe crash the famous programmers' website is named after
  4. 202Network ProtocolsThe Internet Is a Stack of EnvelopesGlobal communication works because each layer has one job
  5. 203Raster GraphicsJaggiesBlurring edge pixels slightly makes diagonal lines look smooth
  6. 205Mechanical EngineeringThe Elevator CounterweightA hidden weight means the motor barely lifts anything
  7. 206Queueing TheoryWhy the Other Line Always Moves FasterWith three lines, yours is the fastest only a third of the time
  8. 207Wireless NetworksWhy Wi-Fi Dies in the KitchenMicrowaves, walls and water all fight your signal