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:
-
Notifications
You must be signed in to change notification settings - Fork 0
eflynn/SudokuSolver
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published