17 Feb 2005
CS 3243 - Constraint Satisfaction
45
Summary
nCSPs are a special kind of problem:
nstates defined by values of a fixed set of variables
ngoal test defined by constraints on variable values
n
nBacktracking = depth-first search with one variable assigned per node
n
nVariable ordering and value selection heuristics help significantly
n
nForward checking prevents assignments that guarantee later failure
n
nConstraint propagation (e.g., arc consistency) does additional work to constrain values and detect inconsistencies
n
nIterative min-conflicts is usually effective in practice