Artificial Intelligence Nanodegree
Introductory Project: Diagonal Sudoku Solver
Question 1 (Naked Twins)
Q: How do we use constraint propagation to solve the naked twins problem?
A: We prune the search space by checking for naked twins in all units
including the diagonal units. This results in progressive propagation of
the naked twins constraint through the search space.
Question 2 (Diagonal Sudoku)
Q: How do we use constraint propagation to solve the diagonal sudoku problem?
A: We establish the constraint that the diagonal units must not have
repeating values. This is done by adding the two diagonal units to the unit
list. Then as we do the search, we apply this constraint during
the reduction phase. Thus we propagate the constraint through the search
space.
Install
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.
Optional: Pygame
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.
Code
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.
Visualizing
To visualize your solution, please only assign values to the values_dict using the assign_values function provided in solution.py
Data
The data consists of a text file of diagonal sudokus for you to solve.