Talk:Solve a Hidato puzzle: Difference between revisions
Content added Content deleted
m (→TCL counterexample: give the answer to the counter example) |
m (→TCL counterexample: fix language name) |
||
| Line 51: | Line 51: | ||
: Perhaps worthy of its own task. There are probably lots of interesting research and discussion for Numbrix. --[[User:Dgamey|Dgamey]] 21:05, 13 January 2012 (UTC) |
: Perhaps worthy of its own task. There are probably lots of interesting research and discussion for Numbrix. --[[User:Dgamey|Dgamey]] 21:05, 13 January 2012 (UTC) |
||
== |
== Tcl counterexample == |
||
The |
The Tcl code logic is unsound: even if a unique solution exists, it doesn't mean any "leg" of the initial puzzle has a unique partial solution. Try this: |
||
<lang tcl>solveHidato " |
<lang tcl>solveHidato " |
||
. 4 . |
. 4 . |
||