solve suduko puzzle using Dept First Search DFS algorithm

in this code we will take any typical Sudoku puzzle and try to find the sulution using Dept First Search or DFS algorithm .

PRINCIPLE

tree of possibilities

first of all you should find the tree of possibilities as shown bellow

Apply DFS algorithme

the basic idea is to start from the root (typical Sudoku puzzle) and mark the node and move to the adjacent unmarked node and continue this loop until there is no unmarked adjacent node (means thats it's not a solution path). Then backtrack and check for other unmarked nodes and traverse them, until finding the solution path.

Author

• Ahmed Jellouli - ELECTRICAL ENGINEERING STUDENT INTERESTED IN DATA ANALYSIS

License

This project is licensed under the MIT License - see the LICENSE file for details