What is a constraint satisfaction problem (CSP) and what are the different approaches for solving it?
A CSP is defined as a set of Variables and each variable has a finite set of possible values called its domain. A CSP is then defined by a set of constraints which restrict the values that the variables can take. An example of a CSP could be the Sudoku game. It should be noted that a CSP can have one, more or maybe even no solution at all. A lot of search methods and heuristics are used in combination to solve CSP’s. Some of the algorithms include Backtracking, Arc Consistency Algorithm, etc.
