Constraint satisfaction problems (CSPs)
	n Standard search problem: n state is a “black box” – any data structure that supports successor function, heuristic function, and goal test n CSP: n state is defined by variables Xi with values from domain Di n goal test is a set of constraints specifying allowable combinations of values for subsets of variables n Simple example of a formal representation language n Allows useful general-purpose algorithms with more power than standard search algorithms