
6 Aug
2007
6 Aug
'07
10:09 p.m.
j.vimal:
On 8/7/07, Hugh Perkins
wrote: Note that the "official" way to solve sudoku is to use "dancing links", but I guess you are creating a naive implementation precisely as a base-line against which to measure other implementations?
Well, Dancing Links (DLX) is just a data structure + few techniques to help with the backtrack, after modeling Sudoku as a contraint satisfaction problem.
You can write a backtracking algorithm that is at least as fast as DLX :-)
See also, http://haskell.org/haskellwiki/Sudoku -- Don