Q: How do we use constraint propagation to solve the naked twins problem?
A: Constraint propagation is used in the naked twins by eliminating some of the values in the peers. The naked twins technique identifies a pair of boxes belonging to the same peers and have the same set of two numbers as values. The peers to these boxes will then have these two numbers eliminated reducing the search space and values of the peer boxes.
Q: How do we use constraint propagation to solve the diagonal sudoku problem?
A: The constraint propagation used in the diagonal problem is to include the diagonal in the peer list. This adds the constraint that a box that has a diagonal as a peer must also look at the diagonal for similar number values and remove them, reducing the total search space and placement of possible values on the grid.
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.