from Hacker News

Optimization. What sub-paths visit all states in minimum time?

by daly on 12/10/24, 4:23 AM with 1 comments

From Stratford Texas to Elkhart Kansas there is a path that will also visit Texas, New Mexico, Oklahoma, Colorado, and Kansas, about 3 hours.

There is a path through Washington, Idaho, and Montana, about 70 miles and 1.5 hours.

New York to Maine path includes Connecticut, Massachusetts, and New Hampshire takes about 5 hours.

Utah, Colorado, New Mexico, and Arizona all meet in a "corner". There is a tourist marker that could be walked around in a few seconds.

Illinois, Arkansas, Kentucky, Tennessee, and Missouri takes about 2.5 hours.

So the optimization question is: What is the shortest set of paths that will visit all 50 states in the minimum time?

If you have access to an AI that knows geography and roads this might generate interesting metrics.

  • by AlDante2 on 12/10/24, 10:43 AM

    As you don’t specify the available paths nor all of the states, the question as it stands is ill-posed.