Simple 9x9 sudoku solver that iteratively checks each empty square against the following:
- Numbers that exist in horizontal row
- Numbers that exist in vertical column
- Numbers that exist in the 3x3 grid
If there is only one possible solution for a given empty square, the square is filled with the number
Fill up the existing values in solver.js
and run npm start
.
Uses {x, y}
notation, where x
is the horizontal row while y
is the vertical column
- Tree solver for cases where no simple solution can be found
- Checker for alternative solutions
- Add a proper initial value loader