Q: How do we use constraint propagation to solve the naked twins problem?
A: We add a new 'strategy' to tackle the problem (in addition to eliminate and only_choice strategies).
The pseudo-code for the naked twins algorithm is as follows:
For every box with 2 characters
Look into each unit (the box belongs to)
If we find the same char combination
Remove each of 2 characters from every other box in the same unit
Q: How do we use constraint propagation to solve the diagonal sudoku problem?
A: Instead of adding a new strategy like we did in the naked twins problem, this time
we add additional constraints to the boxes that are on the main diagonals of the sudoku board.
The existing code was able to solve this new problem without a need for code modification
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.