Q: How do we use constraint propagation to solve the naked twins problem?
A: A pair of naked twins is one defined as two squares in the same column, row, 3x3 box or diagonal that share the same pair of values.
We use constraint propagation to eliminate these two values from other squares that share the same column, row, 3x3 box or diagonal.
Q: How do we use constraint propagation to solve the diagonal sudoku problem?
A: We use constraint propagation by only allowing the numbers 1 - 9 to appear only once diagonally.
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 function.py
The data consists of a text file of diagonal sudokus for you to solve.