21 Jan 2004
CS 3243 - Heuristics
30
Local search algorithms
nIn many optimization problems, the path to the
goal is irrelevant; the goal state
itself is the solution
nState space = set of "complete"
configurations
nFind configuration satisfying constraints, e.g., n-queens
nIn such cases, we can use local search algorithms
nkeep a single "current" state, try to improve
it