Constraint Satisfaction Problems (Chapter 6). What is search for? Assumptions: single agent, deterministic, fully observable, discrete environment Search.
Constraint Satisfaction Problems. Constraint satisfaction problems (CSPs) Definition: – State is defined by variables X i with values from domain D i.
