| Node Consistency |
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Node
consistent – each domain obeys unary |
|||||||||||
| constraints |
||||||||||||
| – | (e.g.
Vermont’s domain is reduced to the singleton set |
|||||||||||
| “green”.) |
||||||||||||
| – | Easy
to do, avoids wasted work |
|||||||||||
| – | Usually
done at problem formulation level |
|||||||||||
| • | Suppose
New York is colored green. How to |
|||||||||||
| propagate
this to the constraints of adjacent states? |
||||||||||||
