Solves Sudoku using recursive backtracking.
Run it, then enter a puzzle file path like puzzles/example1.txt.
- Compile the code:
- Run the program:
- When asked, enter a puzzle file path, for example:
A text file with 9 rows of numbers.
Use 0 for empty spaces. Example:
0 0 3 0 2 0 6 0 0 9 0 0 3 0 5 0 0 1 0 0 1 8 0 6 4 0 0 0 0 8 1 0 2 9 0 0 7 0 0 0 0 0 0 0 8 0 0 6 7 0 8 2 0 0 0 0 2 6 0 9 5 0 0 8 0 0 2 0 3 0 0 9 0 0 5 0 1 0 3 0 0