I am working on a parallel brute-force solver, which will be tested on
25x25 puzzles (my current serial solver requires less than 1 second for
the most difficult 9x9 puzzles I've been able to find; while I haven't
tried it on 16x16 puzzles on one of the machines in the Brooklyn College
Metis cluster, extrapolation from another machine indicates that 16x16
puzzles will take 15-20 minutes; the 25x25 test case I have requires about
a week on a cluster machine).
Unfortunately, we have a lot of preparatory work to do, so it will be a
while before I have any results from a puzzle solver.
The parallel work will be done on our parallel version of release 5
Haskell.
Murray Gross
Brooklyn College
On Tue, 7 Aug 2007, Donald Bruce Stewart wrote:
hughperkins:
On 8/7/07, Donald Bruce Stewart <[EMAIL PROTECTED]>
wrote:
See also,
[2]http://haskell.org/haskellwiki/Sudoku
-- Don
Just out of ... errr.... curiosity... which of those
implementations is the fastest?
No idea. You could compile them all with -O2, run them on a set of
puzzles, and produce a table of results :-)
I'm a little surprised no one's tried a parallel solution yet, actually.
We've got an SMP runtime for a reason, people!
-- Don
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe