Hi ! Does anybody know how to solve the "Knight Problem" ? Cheers, Christoph
On Thu 01 Feb, Christoph M. wrote:
Does anybody know how to solve the "Knight Problem" ? Cheers,
Are you refering to the problem of a "knight's tour" (of a chess board)? If so, the answer is yes, I know how to solve this :-) (I'll explain on the Haskell-cafe list if you like.) Regards -- Adrian Hey
From: "Christoph M." <christoph@cm-arts.de> Date: Fri, 2 Feb 2001 00:15:53 +0100
Does anybody know how to solve the "Knight Problem" ?
If you mean the Knight's Tour problem, the answer is yes. I coded up a version as an independent study back in grade 12 (1977) --- in COMAL on a Norsk Data machine. Even when displaying character graphics to show each partial solution, it only took a few hours to get to the first solution. So the Haskell program for your assignment should probably run in less than 100 milliseconds to match that. Lars Mathiesen (U of Copenhagen CS Dep) <thorinn@diku.dk> (Humour NOT marked)
participants (4)
-
Adrian Hey -
Christoph M. -
Doug Landauer -
Lars Henrik Mathiesen