This program
was conceived as an answer to the frustrations with solving sudoku′s of ‘Sigmund’, a comic in the dutch newspaper de Volkskrant. He couldn′t solve a 4x4 sudoku. This program solves all NxN puzzles (N=4, 6, 8, 9, 10, 12, 15, 16, 20, 25 or 30). The solution can be added to the puzzle, see the examples. A solution can also be used to design a solvable puzzle.
Version 2.1 contains extra reduction methods which give the algorithm a large boost. Also, for N=16 and larger there is started a new solution process for every available CPU (core) in the system, which multiplies the speed almost with the number of processors.
|
The speed has tripled again by removing unnescessary checks and code optimization. The program is packed as a installer with a dual language (dutch/english) version. The icons give a link to the installers for version 2.10 and 3.00 with full support for irregular formed puzzles respectively.
 (version 2.10.117)
 (version 3.00)
Theo van Soest, august 17, 2010
|