{ "id": "8db4eafeb289c7431098aa02c0ed88b2769b70551d6aa45823751b894de4abe3", "pubkey": "17538dc2a62769d09443f18c37cbe358fab5bbf981173542aa7c5ff171ed77c4", "created_at": 1745506977, "kind": 9802, "tags": [ [ "r", "https://www.math.uwaterloo.ca/tsp/korea/index.html", "source" ], [ "comment", "Map enjoyers, rejoice" ] ], "content": "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. Our computation produced a tour together with a proof that it is a shortest-possible route to visit all 81,998 stops when measured with the OSRM times.", "sig": "d8d24599f934ae125e02f8f7f63b352507302ab53746e658342da56be34164436545ce80292176bf5cf6da3cc2f11463b955eab13b9c44d1e7b625e370bf2158" }