Talk:Solve a Holy Knight's tour

Needs a better description of the task and method of solving it.

If it is like a Hidato puzzle then maybe use a description of such a puzzle as a basis for putting together a description of this tour. We could also do with an algorithm for solving it as well as being pointed at code if possible. --Paddy3118 (talk) 16:03, 1 June 2014 (UTC)

It would also be nice to know if the solution must be a closed Knight's tour or not. --SteveWampler (talk) 22:53, 1 June 2014 (UTC)

There is no requirement for the tour to be closed. The REXX solution is not closed, but neither is the board exactly as in the example. The task asks that the example is solved, there is more than 1 solution, any is acceptable. You may show other boards in addition with discretion.--Nigel Galloway (talk) 14:51, 2 June 2014 (UTC)

Haskell Entry

A note mostly for Cromachina: currently the Haskell entry is nice but relatively slow. Perhaps it's worth adding a second alternative version that is very similar but uses one STUArray (mutable arrays of ints to ints) to keep the game table, as in D entry, and compare the performances.