The most efficient path that visits each of 2 million stars just once
Roskilde University and University of Waterloo
We have found the best path to take between the stars. The travelling salesman problem, an infamous mathematical puzzle that seeks the shortest route between many locations while visiting each only once and returning to the first, has been solved on the largest scale yet: the galaxy.
The travelling salesman problem seems simple, but it is notoriously difficult. It can be solved for specific data sets, but a general algorithm to solve any instance of the problem hasn’t yet been …
You may also like
New Bariatric Portion Plate Helps Bariatric Patients Reach Their Goals
2021 preview: how soon will a Covid-19 vaccine normalize life?
Official British statisticians had concerns about the trend in the Covid-19 poll
NASA’s probe on Mars may feel the ground shake when rovers land in 2021
International Study Shows This Brain Supplement Reverses Years of Mental Decline and May Also Reduce the Risk of Dementia