Quick definition of a csP Constraint Satisfaction Problem(L,V, C) I a set of variables Vi, a set of possible values for each variable in I C, a set of Ci] constraints, each a binary relation C={Cl,1….C,nC2,1..C2,n…,Cn,n a Solution is found when each variable i is assigned a value from it' s domain vi and the set of all Constraints {C} is satisfiedQuick Definition of a CSP Constraint Satisfaction Problem ( I,V,C ) - I , a set of variables , a set of variables - Vi, a set of possible values for each variable in a set of possible values for each variable in I. - C, a set of , a set of Cij constraints, each a binary relation constraints, each a binary relation C = {C1,1 … C1,n C2,1 … C2,n … Cn,n} A Solution is found when each variable I is assigned a value from it’s domain Vi and the set of all Constraints {C} is satisfied