Talk:Solve a Hidato puzzle: Difference between revisions
→On the application of Warnsdorff to Hidato
No edit summary |
|||
Line 123:
== On the application of Warnsdorff to Hidato ==
This task's origional premise was that the Knights Tour and Hidato are the same problem requiring only a change of adjacency list.
Normal Hidato are simpler than the Knight's Tour. But considering that Mathprog can solve the Knight's Tour without being commited to Intensive Care for emergency minisat due to induced numerical instability, we must conclude that it is possible to create Hidato's more difficult than Knight's Tours.
If they are the same problem then that which is truth for Knigh't Tour is truth for Hidato. Therfore it seems appropriate to Warnsorff Hidato.
Evil1 and the task's example indicate this does little harm (if only C programmers trained as doctors!). And now we snake it in 16 hunredths of a second.
Finally can we also do the Knight's Tour?
| |||