Important ideas in solving CSPs
Variable order heuristics:
Pick the variable with smallest domain
Or the variable that constrains most other variables
Or the variable that supports most unit propagation
Forward Checking: Filter out future variable domains
based on current assignments
--Unit propagation fills this role in SAT
DDB: Explain the failure at the dead-end
nodes in terms of violated constraints,
and during backtracking, skip over decisions
that do not affect the explanation
EBL: Remember interior node failure explanations
as additional (implied) constraints)
Local Search Methods: Change the assignment leading
to most increase in the number of satisfied constraints
B & v = D & u = C & w= E }
B & v = D & u = C & w= D }