Traveling Salesman Problem solved – by a non-human lifeform

The Traveling Salesman Problem goes like this … if a chap has a set of cities he needs to make calls in, then how does he calculate the optional route such that he only calls into each city once? The solution is known of course because it has been one of the most intensively studied … Read more