Sudoku Solver by Recursive Backtracking
Recursive backtracking is a well-known brute-force search algorithm. As long as a Sudoku puzzle is valid, it can be solved by recursive backtracking, i.e. trying all possible numbers systematically. When the puzzle has many solutions, it will output the lexicographically first one. If it has no solution, the output is the original unsolved puzzle.
*Thumbnail image taken from Wikipedia: https://en.wikipedia.org/wiki/Sudoku_solving_algorithms
引用格式
Karl Ezra Pilario (2024). Sudoku Solver by Recursive Backtracking (https://www.mathworks.com/matlabcentral/fileexchange/65165-sudoku-solver-by-recursive-backtracking), MATLAB Central File Exchange. 检索来源 .
MATLAB 版本兼容性
平台兼容性
Windows macOS Linux标签
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!