Q: How do we use constraint propagation to solve the naked twins problem?
A: 1. Identify all the twins with length of two, then together with its peers that
have the same digits.
2. Use set intersection function to identify naked twins
3. Remove the corresponding digits from the peers of naked twins
Q: How do we use constraint propagation to solve the diagonal sudoku problem?
A: Each digit from 1-9 can occur only once across the two diagonals in a sudoku.
- Perform elimination, one choice and search to reduce the possibilities in boxes
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.
To visualize your solution, please only assign values to the values_dict using the assign_values function provided in solution.py