(Naked Twins) Q: How do we use constraint propagation to solve the naked twins problem?
A: The constraints of the game determine that by necessity if 2 boxes in the same row,column,square or diagonal have identical 2 digit possibilities then no other box in this same unit may have either of these 2 digits within its possibilities since both values will be assigned. The other boxes in the unit are not affected by the choice value goes to which of the 2 boxes. Thus both can be eliminated, decreasing the search space. #Question 2 (Diagonal Sudoku) Q: How do we use constraint propagation to solve the diagonal sudoku problem?
A: In the same manner as in the original sudoku problem with the added 2 diagonal constraints. The rules of the game provide the constraints which were applied to reduce the search space through various functions.
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.