|Freaxmind 36aacf8a85 Update README.md||2 years ago|
|images||2 years ago|
|objects||2 years ago|
|PySudoku.py||2 years ago|
|README.md||2 years ago|
|solution.py||2 years ago|
|solution_test.py||2 years ago|
|visualize.py||2 years ago|
Q: How do we use constraint propagation to solve the naked twins problem?
A: The “naked twins constraint” is used as an additional strategy to reduce the search space at each search step. This is similar to the “eliminate” and “only choice” strategies that were implemented earlier. For each unit, we remove digits that are part of the naked twins found in the same unit.
Q: How do we use constraint propagation to solve the diagonal sudoku problem?
A: The current model implements a nice abstraction about “units”, which are related constraints over boxes in the grid. By adding a vector of units for diagonals (DUNITS), we can extend the pruning of each strategy without changing their code.
This project requires Python 3.
We recommend students install Anaconda, a pre-packaged Python distribution that contains all of the necessary libraries and software for this project. Please try using the environment we provided in the Anaconda lesson of the Nanodegree.
Optionally, you can also install pygame if you want to see your visualization. If you’ve followed our instructions for setting up our conda environment, you should be all set.
If not, please see how to download pygame here.
solutions.py- You’ll fill this in as part of your solution.
solution_test.py- Do not modify this. You can test your solution by running
PySudoku.py- Do not modify this. This is code for visualizing your solution.
visualize.py- Do not modify this. This is code for visualizing your solution.
To visualize your solution, please only assign values to the values_dict using the
assign_values function provided in solution.py
The data consists of a text file of diagonal sudokus for you to solve.