[Haskell-cafe] The Knight's Tour: solutions please
bertram.felgenhauer at googlemail.com
Mon Dec 1 13:39:13 EST 2008
Don Stewart wrote:
> Lee Pike forwarded the following:
> "Solving the Knight's Tour Puzzle In 60 Lines of Python"
> 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.
More information about the Haskell-Cafe