17 Feb 2005
CS 3243 - Constraint Satisfaction
12
Standard
search formulation (incremental)
Let's
start with the straightforward approach, then fix it
States
are defined by the values assigned so far
nInitial state: the empty assignment { }
nSuccessor function: assign a value to an unassigned variable that does not conflict with current assignment
à fail if no legal assignments
nGoal test: the current assignment is complete
1.This is the same for all CSPs
2.Every solution appears at depth n with n
variables
à use depth-first search
à use depth-first search
3.Path is irrelevant, so can also use complete-state
formulation