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
Maps Mania