This is a class Final Project for Data Science 497 (Principles of Artificial Intelligence) at Penn State University. Modeling a Sudoku puzzle as a constraint satisfaction problem allows for interesting variations in the solutions. Our team investigated the runtimes of various heuristics that are commonly used in constraint satisfaction problems. Please check out the Final Project PDF file to see our full report.
-
Notifications
You must be signed in to change notification settings - Fork 0
jdukewich/DS497Project
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Final Project for Data Science 497 (Principles of Artificial Intelligence) at Penn State University
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published