Don Stewart wrote: > Lee Pike forwarded the following: > > "Solving the Knight's Tour Puzzle In 60 Lines of Python" > > http://developers.slashdot.org/article.pl?sid=08/11/30/1722203 > > Seems that perhaps (someone expert in) Haskell could do even better? > Maybe even parallelize the problem? :)
As one of the posters there points out, for n=100 the program doesn't actually backtrack if the 'loneliest neighbour' heuristic is used. Do any of our programs finish quickly for n=99? The Python one doesn't. Bertram _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
