Broad intuition · Study map 2 of 85
Search, logic, and planning
Suggested preparation: AI, ML, deep learning, and generative AI
Picture it
Imagine a maze of possible next moves. Search explores the maze; a heuristic estimates which direction is promising. Logic and constraints rule out impossible moves before you waste work exploring them.
What to understand
- Breadth-first search, A*, and heuristic quality
- Constraint satisfaction, knowledge representation, planning, and minimax
Follow the references
1 · Course notes
UC Berkeley · Introduction to Artificial Intelligence ↗Use the search, constraint satisfaction, and games chapters. Trace a tiny search tree before comparing algorithms.
You understand it when…
Why can a planner find a valid schedule without learning any neural-network weights?
This is a study map. Follow the reference for the full explanation; use the question to test your mental model. Browse the reference shelf.