Finite Discrete Domains

• In this class, we're largely interested in constraint satisfaction problems with finite, discrete domains.
• Finite is opposed to infinit; we're not ready to handle maps with an infinite number of countries.
• We're also going to have discrete variables and constraints, so we're not using continuous variables such as time.
• Again we can approximate continuous domains with discrete domains.
• Note how this language is the language of search spaces.
• Note that if the constraints are binary, you can represent the problems with a constraint graph, like in map colouring.