Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re^12: Travelling problem (Anyone better 86850?)

by BrowserUk (Pope)
on Dec 27, 2013 at 09:02 UTC ( #1068490=note: print w/ replies, xml ) Need Help??


in reply to Re^11: Travelling problem (Anyone better 86850?)
in thread Travelling problem

Here's my second attempt at a threaded version. Running it with -T=24 won't be fastest unless you have 24 cores, but it has the interesting side effect of running all first picks in parallel.

Ignore this! (I was forgetting to add the last distance :( )which yields several better than 84860 scores in just a few minutes:

Source:

I've also recoded the algorithm into C which runs very quickly, but so far I haven't threaded it.


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.


Comment on Re^12: Travelling problem (Anyone better 86850?)
Select or Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1068490]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (10)
As of 2015-07-31 05:13 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (274 votes), past polls