Q: How do we use constraint propagation to solve the naked twins problem?
A: In a unit a pair has same pair of possible values. Either one is one of these possible values. So the other boxes in the unit cannot have these possible values.
Propagate through all the units, find the twins with same possible values, remove these values from the other boxes of the unit.
Q: How do we use constraint propagation to solve the diagonal sudoku problem?
A: In a diagonal sudoku, the diagonals should have unique values in each box. So the units, and thus peers, should be expanded by these diagonal units.
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.
solution.py- You'll fill this in as part of your solution.solution_test.py- Do not modify this. You can test your solution by runningpython solution_test.py.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