Topics covered:
- Terminology: constraint graph, variable, value, domain, constraint
- Four strategies for constraint satisfaction:
1. Depth-First Search (DFS)
2. DFS + Forward-Checking (FC)
3. DFS + FC + Propagation through Singleton Domains (Prop-1)
4. DFS + FC + Propagation through Any reduced domains (Prop-Any)
- Domain reduction before search
Example problems:
- Time Travelers problem from 2009 Quiz 2
- a section of the Lion King/Zoo problem from 2011 Quiz 2