If you spent 40 years of your life on this path, you would still be visiting 5.616 bars per day. Nuts.
Less than 6 bars a day is pretty doable! :-p
Isn't comma the decimal separator ;)
Shortest-possible walking tour to 81,998 bars in South Korea
21–30 of 147 posts
Re: Shortest-possible walking tour to 81,998 bars in South Korea
#22Earlier quoted context omitted.
One would hope with 5x fewer people!
I think it’s far fewer, probably under 5,000 if we are really talking about “bars” and not any ole liquor licensed establishment such as a restaurant…
It seems like you're pretty close with that guess.
https://www.ibisworld.com/us/industry/ohio/bars-nightclubs/1... (2025) estimates there are about 3,000 "bars and nightclubs" in Ohio.
And https://vinepair.com/articles/map-states-with-most-bars/ (2022) estimates there are 1800 bars in Ohio, apparently placing it in the Top 10 of states with the most bars.
Re: Shortest-possible walking tour to 81,998 bars in South Korea
#23I am overwhelmed with the thought of nearly 82 thousand bars within a country roughly the size of Ohio.
Looks like they got their hands on a dataset of every restaurant that is licensed to serve alcohol -- or at least a decent subset of such restaurants, filtered by menu or whatever.
I checked a few dots near where I live and they're all fried chicken joints. Yeah, we do love chimaek around here. :)
Re: Shortest-possible walking tour to 81,998 bars in South Korea
#24I am overwhelmed with the thought of nearly 82 thousand bars within a country roughly the size of Ohio.
[deleted]
Re: Shortest-possible walking tour to 81,998 bars in South Korea
#25[flagged]
Not sure what you expected to get. The Concorde TSP solver is an exact solver that uses branch and bound search, it will return either a solution with a specified bound or the optimal bound. They provide the dataset and the solution they found (and I believe their solver is open source), if you don't believe them you can go ahead and find a better tour.
Re: Shortest-possible walking tour to 81,998 bars in South Korea
#26[flagged]
Not sure what you expected to get. The Concorde TSP solver is an exact solver that uses branch and bound search, it will return either a solution with a specified bound or the optimal bound. They provide the dataset and the solution they found (and I believe their solver is open source), if you don't believe them you can go ahead and find a better tour.
I also expected to get an actual proof.
Re: Shortest-possible walking tour to 81,998 bars in South Korea
#27Would be nice if they could briefly describe the algorithm. Sounds like they’ve turned the TSP into an integer linear program that they can do branch and bound on, but I’m not sure.
Re: Shortest-possible walking tour to 81,998 bars in South Korea
#28I'm impressed they found a dataset this hard, but not much harder. It's a delicate balance between beating the last Traveling Salesman hiscore (Netherlands), and never finishing your compute
Do we know they didn’t just prune problematic bars from the dataset until they found a one with a solution?
Re: Shortest-possible walking tour to 81,998 bars in South Korea
#29If you spent 40 years of your life on this path, you would still be visiting 5.616 bars per day. Nuts.
That’s also not considering whether they’re open or existing anymore after so much time has passed.
Re: Shortest-possible walking tour to 81,998 bars in South Korea
#30It would suck to get to bar 51,248 only to find out it's now permanently closed