This page describes a Groovy solution for ShortestSudokuSolver. Check the link for all the details, but basically the puzzle state is fed in as a String. Each line of the script must be no more than 80 characters in length.
The solution (191 characters plus 2 newlines):
- The script could be 25 characters shorter if Groovy supported integer division.
- The script would be 2 characters longer if you want to use
- To make the function stop as soon as it finds the first solution (proper puzzles will only have one solution), the
else println a;System.exit(1)
Add the following line to the script to solve a partially complete puzzle (should take just a few seconds):
Alternatively, add the following line to the script to solve a puzzle from scratch (may take 30-60 minutes or more):
The expected output is:
Here is the more usual representation of the puzzle:
You can run it from the command-line by adding
;r args to the end of the script (saved in a file called
sudoku.groovy) and then invoking:
A slightly longer version using a matcher and no inner closure (213 characters plus 2 newlines):
Also see another version for a more understandable (though much longer) algorithm.