Get the latest tech news
Shortest-possible walking tour to 81,998 bars in South Korea
We have solved a traveling salesman problem (TSP) to walk to 81,998 bars in South Korea. The problem was created using the Open Source Routing Machine (OSRM) to build a table of the 3,361,795,003 point-to-point travel times, one for each pair of bar locations.
The problem was created using the Open Source Routing Machine(OSRM) to build a table of the 3,361,795,003 point-to-point travel times, one for each pair of bar locations. You will need to stop for plenty of drinks along the way (better stick with water, tea, or Diet Coke if you want to finish the route in only a few years), so it's not likely you would count every second on such a journey. Newspapers, popular journals, blogs, and scientific press releases regularly report that solving even tiny instances of the TSP is impossible with the current generation of computers.
Or read this on Hacker News
