Q: How do we use constraint propagation to solve the naked twins problem?
A: The constraint is, that a number can exist only once in a unit. Since the twins already contain 2 certain values and these can only exist in these boxes, we can remove them from the other possible boxes in the unit.
Q: How do we use constraint propagation to solve the diagonal sudoku problem?
A: We add two additional units (the two diagonal lines) to the unit_list. The algorithms stay the same, because they are programmed to use the units as constraints.
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.