Q: How do we use constraint propagation to solve the naked twins problem?
A: First we have to find out the naked twins pair of each unit by only listing the double digit boxes and then do the filtering work which list down the duplicated pairs. Afterword, a would use the naked twins nature to find out the other empty box's value within its unit. Afterward, we can solve the Sudoku.
Q: How do we use constraint propagation to solve the diagonal sudoku problem?
A: I added a diagonal_unit into the unitlist which included a new criteria for the elimination, only choice, reduce puzzle and search functions which enable it to solve the Diagonal Sudoku Case
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.