14 Apr 2005
CS 3243 - Revision
20
Local search algorithms
¡Hill climbing search –
choose best successor
¡Beam search – take the
best k successor
¡Simulated annealing –
allow backward moves during beginning steps
¡Genetic algorithm –
breed k successors using crossover and mutation