27 Jan 2005
CS 3243 - Heuristics
36
Simulated annealing search
n
Idea: escape local maxima by allowing some "bad"
moves but
gradually decrease
their frequency
n
