On 8/7/07, Hugh Perkins <[EMAIL PROTECTED]> 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 :-) -- Vimal _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
