17 Feb 2005
CS 3243 - Constraint Satisfaction
43
Local search for CSPs
nHill-climbing, simulated annealing typically work with "complete" states, i.e., all variables assigned
n
nTo apply to CSPs:
nallow states with unsatisfied constraints
noperators reassign variable values
n
nVariable selection: randomly select any conflicted variable
n
nValue selection by min-conflicts heuristic:
nchoose value that violates the fewest constraints
ni.e., hill-climb with h(n) = total number of violated constraints