Talk:Solve a Hidato puzzle: Difference between revisions
Content added Content deleted
(→Needed improvements: Why "Knights Tour"?) |
(→Needed improvements: agreed on Knights Tour adding little here) |
||
| Line 18: | Line 18: | ||
: I'm not convinced that the Knight's Tour part adds anything at all to this, as one of the most useful techniques that is applicable to this problem (pruning pathing solution candidates that provably can't reach the goal; that's implied by the use of the Moore Neighborhood) doesn't apply at all. The nice thing seems to be that this is a ''fast'' problem, despite needing fairly complex searching. –[[User:Dkf|Donal Fellows]] 19:15, 15 January 2012 (UTC) |
: I'm not convinced that the Knight's Tour part adds anything at all to this, as one of the most useful techniques that is applicable to this problem (pruning pathing solution candidates that provably can't reach the goal; that's implied by the use of the Moore Neighborhood) doesn't apply at all. The nice thing seems to be that this is a ''fast'' problem, despite needing fairly complex searching. –[[User:Dkf|Donal Fellows]] 19:15, 15 January 2012 (UTC) |
||
:: Donal, I'm with you on this. While I might be interested in a link to some side reading as background, I can't see doing both. I don't think it's a simple as just swapping in another adjacency function and we already have a separate Knight's Tour task. --[[User:Dgamey|Dgamey]] 20:02, 15 January 2012 (UTC) |
|||
== Rules == |
== Rules == |
||