Example: confidence
Solving Constraint Satisfaction Problems (CSPs) using Search

Solving Constraint Satisfaction Problems (CSPs) using Search

Back to document page

Sudoku – variables are cells – domain of each variable is {1,2,3,4,5,6,7,8,9} ... 16 . Constraint Satisfaction Problems: Variants • We may want to solve the following problems with a CSP: – determine whether or not a model exists – find a model

  Sudoku

Download Solving Constraint Satisfaction Problems (CSPs) using Search


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement