Talk:Knight's tour: Difference between revisions
Content added Content deleted
(remove redundant comment) |
|||
| Line 106: | Line 106: | ||
:::: Thanks. How are you breaking ties? Roth? (Also can you find a solution on 7x7 starting on a2? see above. --[[User:Dgamey|Dgamey]] 13:23, 3 June 2011 (UTC) |
:::: Thanks. How are you breaking ties? Roth? (Also can you find a solution on 7x7 starting on a2? see above. --[[User:Dgamey|Dgamey]] 13:23, 3 June 2011 (UTC) |
||
::::: I did not write this code. It is using the lowest index in the case of a tie. And this version failed when I tried to get it to find a 7x7 solution starting on a2 (index 1). |
::::: I did not write this code. It is using the lowest index in the case of a tie. And this version failed when I tried to get it to find a 7x7 solution starting on a2 (index 1). --[[User:Rdm|Rdm]] 13:55, 3 June 2011 (UTC) |
||
::::: It might be interesting to implement backtracking on failure, but I estimate that the 7x7 case has roughly 1e17 alternatives if all ties are considered which suggests that backtracking might be inefficient. (The problem being that we do not know which tie-breaks were the bad ones.) --[[User:Rdm|Rdm]] 13:55, 3 June 2011 (UTC) |
|||
== C++ formatting == |
== C++ formatting == |
||