
© Royal Society Open Science
Unless you've studied math to a pretty high level, you probably haven't heard of the
Traveling Salesman Problem. That's a shame because it's one of the finest examples available to the question we've all asked at some point - "when will I
ever need math in the real world?"
The Traveling Salesman Problem goes like this: Given a list of cities you have to visit, what is the shortest possible route you can take that gets you to every city and back home again?
Students who are assigned the problem in school or college often receive a simple version, planning a journey between, say, four cities. That's not too hard; there are only three possible routes you can take.

© IFL ScienceCan you find all possible routes? If you think there are six, take them backwards to check for duplicates.
But if we double that number to eight cities, there are over 2,500 possible routes we can take - and all of them need to be checked if we want to be sure we've got the shortest one. It's an
NP-hard problem, which means that as we add cities to the list, the amount of time - and pain inflicted on students who are assigned the problem - increases exponentially.
Well, now those students get to feel even worse.
It turns out the problem is so easy, a single amoeba can do it.
Comment: Considering science still doesn't understand many aspects within the universe, such as how planets form or what gravity is, it would be too early to think we truly understand how the universe itself operates: