This project contains a Python implementation of a Sudoku solver. It uses a backtracking algorithm to solve the puzzle.
These instructions will help you get a copy of the project up and running on your local machine for development and testing purposes.
You will need to have Python 3 installed on your system in order to run the solver. You can download the latest version from the official website: https://www.python.org/downloads/
Clone the repository to your local machine.
git clone https://github.com/TABREZ-96/SudokuGenie.git
The solver can be used by calling the solve() function and passing it a 9x9 grid represented as a 2D array. Empty cells in the grid should be represented as 0.
from sudoku_solver import solve
grid = [[5,3,0,0,7,0,0,0,0],
[6,0,0,1,9,5,0,0,0],
[0,9,8,0,0,0,0,6,0],
[8,0,0,0,6,0,0,0,3],
[4,0,0,8,0,3,0,0,1],
[7,0,0,0,2,0,0,0,6],
[0,6,0,0,0,0,2,8,0],
[0,0,0,4,1,9,0,0,5],
[0,0,0,0,8,0,0,7,9]]
solve(grid)
for i in range(len(grid)):
print(grid[i])
This will print the solved sudoku grid.
- Python 3 - The programming language used
- [TABREZ] - Initial work - Github Profile
Hat tip to anyone whose code was used Inspiration etc Note This is a basic implementation, there may be edge cases that are not handled by this solver. Also, there may be multiple solutions for a given sudoku puzzle, this solver will return one of the solutions.
If you found this project helpful or you learned something from it and want to show your appreciation, you can buy me a coffee. Your support will help me to continue maintaining and updating this project.
This project is licensed under the MIT License - see the LICENSE.md file for details
Sudoku Solver - Wikipedia Backtracking - Wikipedia Sudoku Guide Sudoku Solver Python