![]() It turns out that any cell can be swapped with another one (in the same 3 x 3 matrix, of course), as long as the corresponding modifications are made along their rows or columns.Īny valid configuration can be used as seed (i.e. Instead of using a brute-force method, it is possible to modify an existing Sudoku puzzle so that it remains valid. ![]() In any case, I am sharing: Algorithm description The algorithm for the creation of new puzzles is interesting, although probably not the most efficient, and surely someone else has thought it before me. Of course, very soon I found myself on my laptop, writing a program for creating and solving Sudoku puzzles. During a hot summer I used to spend my time solving Sudoku puzzles at the beach - which is quite fun if you are in a must-not-work mode. Today I stumbled on an program I had written years ago.
0 Comments
Leave a Reply. |