Implementing an AI that can solve any sudoku.
The aim of this project was to create a game agent to solve any diagonal sudoku.
The sudoku is solved by using both elimination and constrain propagation. And if with this is not enough the agent uses decision trees to explore different scenarios until it reaches a feasible solution.
This is one of the projects I did when I was taken the Artificial Intelligence Nanodegree. The idea with this project was that we understand and develop a solution using elimination and constrain propagation and decision trees.
The AI created is able to solve any sudoku that have a solution. It can also solve sudokus that have more than one solution but it will only get one of them.
