Constraint satisfaction problem
= Constraint satisfaction problem
Assign values from specified domains to variables so that all stated constraints hold simultaneously. A partial assignment can be rejected when it violates a constraint or leaves an unassigned variable with no permissible value. <Backtracking> applies this test during a <depth-first search>.