-
A sudoku solver that uses backtracking and recursion to solve a puzzle by brute force.
-
Providing an zero matrix of size 9*9 will cause the program to display all possible sudokus possible. with enough time and computing power one can make a list of all possible sudoku solutions. A proper sudoku is a problem having a unique solution.
-
A sudoku matrix can have multiple proper sudoku questions and a lot more non proper questions.
-
The program can solve any sudoku and if it has multiple answers produce all different types of solutions possible.
If you need help regarding Sudoku Solver, then please open an issue or reach out to me through any of the contacts you can find in my GitHub Profile
If you would like to submit a bug report or feature request, please open an issue.
Contributions to this project are always welcome. Please see the Contribution Guidelines to see how to help.
I value a positive and respectful community, and I kindly ask that you follow our code of conduct in all interactions with other members. Please take a moment to review the Code of Conduct.
Please refer the License of this project to understand about your rights.