17 Feb 2005
CS 3243 - Constraint Satisfaction
14
Backtracking search
nVariable assignments are commutative, i.e.,
n[ WA = red then NT = green ] same as [ NT = green then WA = red ]
n
nOnly need to consider assignments to a single variable at each node
nFix an order in which we’ll examine the variables
nà b = d and there are dn leaves
n
nDepth-first search for CSPs with single-variable assignments is called backtracking search
nIs the basic uninformed algorithm for CSPs
nCan solve n-queens for n ≈ 25