Constraint Satisfaction Problem are special type of search in which, a state is defined by variables X with values from the domain D and goal test is a set of constraints specifying allowable combinations of values for subsets of variables.

Many real problems in AI can be modeled as Constraint …