TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

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

2 点作者 daly5 个月前
From Stratford Texas to Elkhart Kansas there is a path that will also visit Texas, New Mexico, Oklahoma, Colorado, and Kansas, about 3 hours.<p>There is a path through Washington, Idaho, and Montana, about 70 miles and 1.5 hours.<p>New York to Maine path includes Connecticut, Massachusetts, and New Hampshire takes about 5 hours.<p>Utah, Colorado, New Mexico, and Arizona all meet in a &quot;corner&quot;. There is a tourist marker that could be walked around in a few seconds.<p>Illinois, Arkansas, Kentucky, Tennessee, and Missouri takes about 2.5 hours.<p>So the optimization question is: What is the shortest set of paths that will visit all 50 states in the minimum time?<p>If you have access to an AI that knows geography and roads this might generate interesting metrics.

1 comment

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