In this project, you will extend the Sudoku-solving agent developed in the classroom lectures to solve diagonal Sudoku puzzles. A diagonal Sudoku puzzle is identical to traditional Sudoku puzzles with the added constraint that the boxes on the two main diagonals of the board must also contain the digits 1-9 in each cell (just like the rows, columns, and 3x3 blocks). You will also implement another strategy called "Naked Twins", described here

The easiest way to complete the project is to click "next" below to open a Workspace that has already been configured with the required files and libraries to support the project. If you use the Workspace, you do NOT need to perform any of the setup steps outlined below ( 1 - 3 steps).
If you would prefer to complete the exercise in your own local environment, then follow the steps below:
(aind) $ git clone https://github.com/udacity/artificial-intelligence
(aind) Projects/1_Sudoku $ python -m unittest -v
(aind) Projects/1_Sudoku $ udacity submit
udacity submit, you need to submit the exact zip file created by the remote test script (named something like "sudoku-######.zip") in the classroom for this project.This project is evaluated according to the rubric here. You will receive full credit on this project for passing all of the test cases; unlike the other projects in the AIND program there is no manual code review for submissions that pass all test cases for the Sudoku solver.