Abstract: Constraint satisfaction problem (CSP) is a problem composed of a finite set of variables, each of which is associated with a finite domain, and a set of constraints can be used to restrict the values of the variables to be simultaneously taken. The task for solving the problem is to assign a value to each variable satisfying all the constraints. In this article, the basic algorithm and search strategies for solving CSP are summarized for the first time. Then a CSP solving system ILOG SOLVER is introduced, which was developed by France ILOG company. Finally, two map-coloring problem solutions are given by using this system.

Key words: constraint satisfaction problem, constraint solving, search strategies