← Mission map

Round 12 of 16

AI and Computational Strategy

📋 What it is

Computers play strategy games by searching many possible moves and evaluating positions — sometimes superhumanly.

🗣️ Coach says

How does a computer play chess or Go so well? It SEARCHES far more move-branches than a human and scores each resulting position, then picks the best. Modern game AIs even LEARN by playing themselves millions of times. Understanding this shows what "thinking ahead" looks like taken to an extreme.

🧠 Memory hook

Computers search millions of branches, score positions, pick the best. Thinking ahead, supercharged.

😂 Giggle

What's a Go player's favorite shape?
An encircle-ment!

😲 Whoa!

In 2016 a Go-playing AI beat a world champion using moves so creative that human masters are STILL studying and learning from them today.

✅ Quick check: How does a game-playing computer decide on a move?

Say your answer out loud first — then reveal.

🧪 Try it! (2 minutes)

Think of a simple game and imagine checking EVERY possible next move. That exhaustive search is what an AI does.

⭐ Do the round to earn your star →
🤸 Brain break: Fast-branch: rapidly point to many spots — an AI searching countless moves at once.