Re: More printf problems 2
At 02:01 AM 11/12/97 -0800, you wrote:
>Geez there must be a lot of traveling salemen who use euphoria and NEED
>THIS ANSWER! Why anyone ELSE would is beyond me. Isn't there a reference
>book somewhere with the correct answer? Just look it up. =)
>
>Somebody write a boxing game...
>
You must be kidding. I hope you are. Surely you know that a complete
solution to the traveling salesman problem would take hundreds of years on
the largest imaginable supercomputer. It's a matter of theoretical interest
only, or something for us types with hyperactive imaginations to play with.
On the other hand, it's not entirely theoretical; Dr. Shawn Carlson, in his
original Scientific American writeup last March, gave a very realistic
situation in which at least some approximation to the solution, if not a
complete solution, would be quite useful. Hence the approach using
Simulated Annealing.
Look up that article. It's very interesting.
Wally Riley
wryly at mindspring.com
|
Not Categorized, Please Help
|
|
