Week 13-14: Constraint Satisfaction Problems

This topic describes a way to solve a wide variety of problems more efficiently. We use a factored representation for each state: a set of variables, each of which has a value. A problem is solved when each variable has a value that satisfies all the constraints on the variable. A problem described this way is called a constraint satisfaction problem, or CSP.
Constraint Satisfaction Problem II
 

Download Files

lecture-13-14.pdf (1.18 MB )

homework-week-13-14.pdf (0.20 MB )