Students who complete this unit will demonstrate that they can:

• Describe and explain the constraint satisfaction search paradigm for problem solving.
• Compare and contrast traditional, local and constraint satisfaction paradigms.
• Formulate a problem specified in natural language (e.g., English) as a constraint satisfaction problem and implement it using a chronological backtracking algorithm or stochastic local search.
• Design and implement a constraint-based problem solver.