The travelling salesman problem – finding the shortest route between many locations – is notoriously tough, but it has now been solved for a map of over 2 million stars
Click here for original story, Mathematicians have found the shortest route to visit 2 million stars
Source: New Scientist – Space