In a nutshell, the traveling salesman problem is as follows: “Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?” Todd Schneider made an interactive that lets you punch in the cities yourself and then watch the process look for an optimum route. Fun to play with even if you’re not into processes. [Thanks, Todd]
A simulation of the traveling salesman problem
Projects by Nathan Yau See All →
What Alcohol People Around the World Drink
Americans get most of their alcohol from beer, but it’s not like that everywhere.
Fast Food Menu of Calories
How does the distribution of calories vary by fast food restaurant? Here’s a chart that shows all the menu items for ten of the biggest national fast food chains.