Soduku (Sudoku) is a Japanese number puzzle game that seems to be taking the world by storm. It’s played on a 9×9 grid. Each square can contain one of the numbers from 1 to 9 (inclusive). A given “problem” has some of the squares filled in, and you are required to fill in the remaining squares, satisfying the constraints:
- Each row has to contain each of the numbers 1 through 9 exactly once.
- Likewise for each column.
- The board can be broken down into 9 3×3 squares (top-left, top-middle, top-right, etc.). Each of these has to contain each of the numbers 1 through 9 exactly once.
Anyway, these puzzles can get pretty tricky. Especially if you don’t know the third rule above — which until recently, I didn’t. Anyway, they’ve sufficient annoyed me now that I had to do something about it; so I wrote
The Langabi.name Soduku Solver
It’s not fancy, but is (in my opinion) very efficient. Enjoy!
Edit: Now available: an explanation of the method my solver uses, and the source code.