Important ideas in solving CSPs
Variable order heuristics:
Pick the most constrained variable
--Smallest domain, connected to most other variables,
causes most unit propagation,
causes most resource contention,
has the most distance etc…
Value ordering heuristics
Pick the least constraining value
k-consistency; adaptive consistency. (pre-processing)
Forward Checking, unit propagation during search (dynamic)
DDB/EBL: Remember and use interior node failure explanations
B & v = D & u = C & w= E }
B & v = D & u = C & w= D }