The Most Optimal Road Trip Maps
In 1954, a landmark paper in computer science famously solved the Traveling Salesman Problem (TSP) by proving the exact, shortest route to visit all 48 contiguous state capitals plus Washington D.C. The underlying puzzle is deceptively simple: given a list of destinations, what is the shortest possible route that visits each location once before returning to the start? That breakthrough kicked off a long tradition of mathematical road trips , inspiring some wonderfully bizarre optimal road trip maps of the United States: Casino Road Trip plots the optimal route to visit all 835 casinos in the United States. The resulting journey covers 33,826 miles and would take around 31 days to complete - although I suspect you'll run out of money long before you reach the final stop. Randy Olson's Optimal Road Trip Across the U.S. tackles a more scenic challenge, calculating the shortest possible route that visits 50 of America's best-known landmarks. The Best Brewery Road Trip E...
