CodePlexProject Hosting for Open Source Software

- Initialize a Sudoku Board (9 x 9 board).
- Solve the initial cells and add each solved cell to a Puzzle Queue.
- Take the top square in the queue and update each row, column and square with the values already solved.
- For every cell in the updated row column and square, remove the solved value as a possible value.
- If any cell remains with only 1 possible value left, solve the cell and add it to the Puzzle Queue.
- If the Puzzle Queue is not empty go to step 3.
- For each row, column and square on the board check if only 1 in the group has any given value as a possible value. If a cell is found, solve it and add it to the queue.
- If the Puzzle Queue is not empty go to step 3.
- Finished

Last edited Mar 22, 2012 at 5:33 PM by campbel, version 1