|Perl: the Markov chain saw|
Travelling Salesman Problemsby tedv (Pilgrim)
|on Nov 08, 2000 at 23:40 UTC||Need Help??|
If you want some good insight into travelling salesman
problems, try playing the board game Elflands by Alan Moon.
I've only played it a few times, but I'm sure that after
10 games, I'd have a much better feel for coming up with
an adequate TSP solution. Note that the perfect TSP solution
is an NP complete problem, so don't aim for the optimal
solution. Aim for "good enough".