14 Apr 2005
CS 3243 - Revision
24
Techniques in CSPs
¡Basic: backtracking
search
lDFS for CSP
lA leaf node (at depth v)
is a solution
¡Speed ups
lChoosing variables
¡Minimum remaining
values
¡Most constrained
variable / degree
lChoosing values
¡Least constraining
value