Constraint satisfaction problems (CSPs) are mathematical problems defined as a set of objects whose ?state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite constraints over variables, which is solved by constraint satisfaction methods.