note nop All this effort for a game?!?<br><br>But since the problem is interesting...<br><br> As the problem is certainly NP, try hueristics. Simulated annealing, GAs, tabu search; whatever. The hard part is how you encode the problem. One clever way uses a sort sequence: <ol> <li> Each depot gets an key, a float between 0 and 1 <li> To determine a tour, sort the depots by key <li> Visit the depots in sorted-by-key order. Return to base (closing the loop) as late as possible (eg going to one more depot would leave you insufficient moves to get home). </ol> Start by randomly assigning keys. Your original tour will be horrible. Improve the tour by any optimization hueristic (annealing, tabu, genetic algs) with reasonable mutuation operators such as <ul> <li> randomly swap the keys of two depots <li> randomly peturb the keys of some depots <li> randomly "cross-over" two tours, by taking key values from each </ul> The nice thing about the encoding is that it creates/maintains good subtours, and is robust to mutations (every list of keys is a well-formed tour). <br><br>I've used this approach in a machine-scheduling problem with good results. Easily coded, unlike breaking out the heavy machinery of integer programming. Good luck. <br> [nop] 40586 40586