|Think about Loose Coupling|
I'm using a genetic algorithm (based loosely on Re^15: Divide array of integers into most similar value halves (Updated)), it gets close very quickly, but has no guarantee to ever find the best. Nor any guarantees about the quality of what it does find. (Nor even any criteria by which to judge that.)
It took less than a minute to find 86850, but much, much longer to refine that to 84860.
I threw the implementation I've been using together late last night and it is pretty crude and messy. Once I've cleaned it up I'll post 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.
In reply to Re^4: Travelling problem (Anyone better <strike>86850</strike> 84860?)