Mathematicians have found the shortest route to visit 2 million stars

Space 23 October 2020
New Scientist Default Image
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 …

Continue reading

Subscribe for unlimited digital access

Subscribe now for unlimited access

Existing subscribers, please log in with your email address to link your account access.

Paid annually by Credit Card

Inclusive of applicable taxes (VAT)

MORE FROM NEW SCIENTIST

robot arm

Warehouse robots upgraded to make packing decisions 350 times faster

Systemic racism: What research reveals about the extent of its impact

Systemic racism: What research reveals about the extent of its impact

Emotion-detecting AIs are here – do they work and how should we feel?

Emotion-detecting AIs are here – do they work and how should we feel?

magnetar

Repeated radio bursts from nearby star suggest such signals are common

841995澳门论坛资料2021年