Talk:Solve a Hidato puzzle: Difference between revisions

m
→‎TCL counterexample: give the answer to the counter example
(→‎TCL counterexample: new section)
m (→‎TCL counterexample: give the answer to the counter example)
Line 53:
== TCL counterexample ==
 
The TCL code logic is unsound: even if a unique solution existexists, it doesn't mean any "leg" of the initial puzzle has a unique partial solution. Try this:
<lang tcl>solveHidato "
. 4 .
0 7 0
1 0 0
"
"</lang> and the program will fail to find anything. --[[User:Ledrug|Ledrug]] 18:15, 1 May 2012 (UTC)
# solution:
# . 4 .
# 3 7 5
"# 1 2 6</lang> and the program will fail to find anything. --[[User:Ledrug|Ledrug]] 18:15, 1 May 2012 (UTC)
Anonymous user