This problem can be solved as a traveling salesman problem. The efficient solution found by this method was not implemented because of factors not incorporated into the objective function.

The most efficient path that visits each of 2 million stars just once We have found the best path to take between the stars. The travelling salesman problem, an infamous mathematical puzzle that ...