A09 · Classical AI: Search, Logic and Planning
A free, illustrated L2 to L3 course of 8 modules in the Applied AI track. Modules include: Agents, state spaces and uninformed search; Heuristic search: A* and admissible heuristics; Adversarial search: minimax and alpha-beta pruning.
A09 L2 to L3 · Intermediate to Advanced 8 modules · about 32 lessons Planned · Ring 3
Part of the Applied AI track. Ships in Ring 3 (Breadth) of the roadmap.
Modules
- Agents, state spaces and uninformed search
- Heuristic search: A* and admissible heuristics
- Adversarial search: minimax and alpha-beta pruning
- Constraint satisfaction problems
- Propositional logic and satisfiability
- First-order logic, unification and inference
- Knowledge representation, ontologies and knowledge graphs
- Automated planning: STRIPS, PDDL and heuristic planners
Signature illustrations
The pictures a learner should still see in their head a year later:
Search trees growing with the frontier highlighted, A* expanding along cost contours, a minimax tree with pruned branches, a constraint graph tightening under arc consistency, resolution proof trees, a knowledge-graph neighborhood, a plan as a path through state space.
Status
This course is planned, not written yet. It ships with Ring 3 (Breadth).
Every lesson will follow the same twelve-part blueprint with at least three purpose-made figures. Watch the repository to hear when modules ship, or help write and review it.