A Survey on Classic Examples of Constraint Satisfaction Problems with Solutions and Applications

The constrained satisfaction problems (CSPs) is one of the problem solving approach in artificial intelligence (AI). It assigns values to variables from their respective domains (domain is the set of values for a variable) by satisfying the constraints which connects subset of variables. It uses reasoning, search or combination of these two techniques to solve the problem. This survey identifies cryptarithmetic, Sudoku, N-queens and scheduling as some of the important classic examples which were solved using CSPs. Also, problem formulation using CSPs and various solutions to these classic problems using CSPs techniques are discussed and indexed. Finally, the contemporary applications of each of these examples are identified and discussed. The survey is very much useful to identify the strength of CSPs and its usefulness to solve problems (in various domains) which are based on identified examples.