Q: How do we use constraint propagation to solve the naked twins problem?
A: We can find naked twins for each unit and eliminate the naked twins from the possibilities of peers within the unit. This procedure should be perform repeatedly until the board does not change by the strategy.
Q: How do we use constraint propagation to solve the diagonal sudoku problem?
A: Compared to normal sudoku, the diagonal sudoku has two more diagonal units. We can add the diagonal units to the unit list and thus constrain that each digit occur only once along the diagonals.
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.