17 Feb 2005
CS 3243 - Constraint Satisfaction
4
Example: Map-Coloring
n
Variables
WA, NT, Q, NSW, V, SA, T
n
Domains
D
i
= {red,green,blue}
n
Constraints
: adjacent regions must have different colors
n
e.g., WA
≠
NT, or (WA,NT) in {(red,green),(red,blue),(green,red),
(green,blue),(blue,red),(blue,green)}