...
See the code details wiki page for explanations of the return types of the reduction and solving methods of GameModel.
To find final solutions from a partial solution, one should look for a square with multiple possible values, generate the different partial solutions by specifying that the square contains one of the values (and impose the restrictions specified by the rules of Sudoku on the content of the other squares), and then recurse for each of these possible solutions until no square has more than one possible value. If square becomes empty, then it will not lead to a final solution. If all squares have exactly one value, then we have a final solution.
The support code provided contains a DrJava project and a few simple Junit tests. The code download is coming "Real Soon Now" ...
...