Anonymous user
Talk:Solve a Holy Knight's tour: Difference between revisions
+ Haskell note
No edit summary |
(+ Haskell note) |
||
Line 5:
--[[User:SteveWampler|SteveWampler]] ([[User talk: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.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 14:51, 2 June 2014 (UTC)
===Haskell Entry===
A note mostly for [[User:Cromachina|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.
| |||