|Welcome to the Monastery|
Re^12: Travelling problem (Anyone better 86850?)by BrowserUk (Pope)
|on Dec 28, 2013 at 01:43 UTC||Need Help??|
successfully completed the restricted branching based on the shortest two or three next available edges
My threaded C version has now completed restricted branching at shortest 2,3,4,5,6,7 available edges and the best it found are:
Note: The numbers are provisional in as much as I have repeated them to check they are repeatable; given the possibility of non-determinacy due to threading.
I'll leave it running overnight on 8.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.