Q: How do we use constraint propagation to solve the naked twins problem?
A: Before when reducing the puzzle, we first used the Eliminate Strategy to find those boxes that only had one possibility and delete this digit of all his companions. Then we applied the Only_Choice Strategy to assign to the boxes with only one possibility this possibility.
Now before launching these two strategies, we use the Naked_Twins strategy to "block" possible naked twins and eliminate all their digits from their peers, so the other two strategies could work better.
Q: How do we use constraint propagation to solve the diagonal sudoku problem?
A: We simply create two new units (diagonals) and add them to the unitlist, because, unitlist is used for create the variables units and peers, which are used in the methods that implement the strategies used
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.