This is a simple implementation to solve any square sudoku puzzle.
It was used in a php contest found here.
My personal goal was to create a working solution as fast as possible. Everything was created within a couple of hours.
The solver is a single function that is executed until the puzzle is solved. Every round it goes through the following flow. If a step succeeds, it wil run the solve function again.
- Fill the missing numbers (for example, if 1-8 is taken, fill 9)
- Fill the numbers that can not be put anywhere else. (this is the
forcedMovemethod) - Make a backup
- Find the place with the least possible values, fill a random one
- If the puzzle is no longer solvable, reset to the backup point
Are you crazy?? That is for reusable code :)
This is because the smallest solution (in bytes) would render 10 points. I considered it a quick win used an online minifier and did some "shift-f6"-ing in phpstorm.
Jup like I said, the goal was to make a working solution as fast as possible.
cat puzzle | php solver.php
php tests.php