Module
Heuristic Search
Sign in to add this module to your path and practice.
About
Greedy best-first, A*, admissible/consistent heuristics, heuristic design (relaxed problems, pattern databases intro), IDA*; local search (hill-climbing, simulated annealing, genetic algorithms light).
Goal
Design admissible heuristics; implement A* and analyze node expansions; apply local search to optimization problems and discuss local optima.*
Prerequisites
Unlocks
Tutor
Ask questions about this module.
Hi — I'm your tutor for Heuristic Search. Ask about the concepts, goal, or where you're stuck.