Q: How do we use constraint propagation to solve the naked twins problem?
A: Constraint propagation is about using a constraint to reduce the search space.
So in here we use the Naked Twins strategy to discard some values of the boxes that are not
feasible to reduce the number of possibilities to search and find the solution.
Q: How do we use constraint propagation to solve the diagonal sudoku problem?
A: Two solve the diagonal sudoku there are two constraint propagation strategies:
elimination and only choice. You first apply one of the constraint, like elimination, and
to recude the search space and then apply the other constraint to keep reducing the space.
You have to alternate this two constraints to solve the problem.
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.