note lhoward This problem has one feature that make is distinct from the classic TSP (Travelling Salesman Problem). In the TSP you must visit every node exactly once. Even if a node is very far away it must be visited. In my case I only need to visit as many nodes as possible in so many moves and can safely ignore nodes that are "too far away". <p> I've tried adpoting spanning-tree approach to solving the TSP with moderate success. But I have already done better with an algorithm of my own. 40586 40589