30 Nov
2008
30 Nov
'08
4:31 p.m.
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? :) So, team, anyone want to implement a Knight's Tour solver in a list monad/list comprehension one liner? These little puzzles are made for fast languages with backtracking monads.... Post solutions to the wiki.. -- Don