Q: How do we use constraint propagation to solve the naked twins problem?
A: When there are two boxes with two numbers and have the same number values in either column or row units, we know that no other box can have any of the number values from the naked twins. Having this constraint in mind, we can further reduce the number of possibilities to solve the puzzle.
Q: How do we use constraint propagation to solve the diagonal sudoku problem?
A: Knowing that the diagonals are simply an addition to the unit constraints, I added the diagonal unit constraint to the unit list. That way it will be taken into account. As a result, the diagonal unit was used in the same way as the column, row, and square units across the program.
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.