Inspired by a famous math problem, “Travelling Salesman” is the story of the American government bringing together four mathematicians to prove p=np and the psychological consequences they face as a result of holding themselves responsible for the possible harm that can occur from sharing their findings with government officials.
Put simply; the traveling salesman problem is as follows: imagine you are a traveling salesman. There are 50 cities you need to visit, and you are given the distances between them. Visiting each city only once, what is the shortest route you could take and order the cities you would need to visit to start and end your trip in the same city?
