Sudoku is a type of Constraint Satisfaction Problem. A CSP is formulated in terms of variables, possible values of the variables (domains), and constraints. Sudoku has 27 global constraints for each row, column, and box. For more information please see the following page: