Search Strategies
📋 What it is
Two ways to explore possibilities: breadth-first (check all near options first) and depth-first (follow one path all the way down).
🗣️ Coach says
When exploring a maze of choices, you can spread out level by level (breadth-first — finds the SHORTEST path) or dive down one path fully before backing up (depth-first — uses less memory). Choosing the right search is half the battle.
🧠 Memory hook
Breadth-first = shortest path, more memory. Depth-first = dive deep, less memory.
😂 Giggle
Why did the deduction bring a flashlight?
To shine light on the one true answer!
😲 Whoa!
The GPS finding your fastest route is running a search strategy on a giant map of roads — the same breadth/depth ideas you use on a puzzle.
✅ Quick check: To find the SHORTEST solution to a puzzle, which search fits better?
Say your answer out loud first — then reveal.
Breadth-first — it checks all short paths before longer ones, so the first solution it finds is the shortest.
Breadth-first explores by distance, guaranteeing the shortest path is found first.
🧪 Try it! (2 minutes)
Explore a small maze two ways: try every near turn first (breadth), then follow one wall deep (depth). Compare.