Q: How do we use constraint propagation to solve the naked twins problem?
A: because if 2 boxes in the same unit have the same 2 digits as possible solutions, only these 2 boxes
can have them, so we know these 2 digits can be removed from all other boxes in that unit. This significanly
reduces the number of potential search digits that have to be checked later.
Q: How do we use constraint propagation to solve the diagonal sudoku problem?
A: Really the same way the other constraint propagation rules (only_choice, naked_twins) are used for all
the other units. We just add 2 new additional 'units' to check.
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 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
The data consists of a text file of diagonal sudokus for you to solve.