Does this include city halls in Virginia? Cities are outside of counties there so you would either skip them or have to include them as if they were counties.

This is the Traveling Salesman Problem. The only way to know for sure if you have the shortest solution is to try every possibility, and that becomes computationally impossible when you have more than a certain number of points.

That was fascinating. I wonder whether different starting counties would converge to a similar path or whether you could get a different order entirely.

I didn't really try with other starting counties but I did consider doing that. I'm guessing you'd end up with fairly similar paths. I'm making one now that uses an optimized round-trip (closed-loop) path. That should be independent of starting county. It'll probably be done tomorrow.

The optimal path one algorithm got was 100,137 miles round trip. There's a link to what the path looks like in another comment. It looks much like what you'd think.

No... this is FAR from optimal. I'm making an optimal one now since I found a nice algorithm for solving (approximately) the Traveling Salesman Problem with 3000 destinations.

This is based on the idea of a greedy algorithm like Dijkstra's. It makes the most optimal LOCAL choice. But systemically that may not be the best over-all choice for an optimal route. It won't give you the best answer, but it'll generally give you a decent answer.

LA has the equivalent to counties. If there was a way to drive to HI, I'd have included it. Same with AK... there are some "counties" there that don't seem accessible by car.

Doing that for the geographic distance would be possible, but I've been using the travel distance here. Getting the turn-by-turn directions between 3000 locations takes some time. Lol.

AKA "Okay, fine, we'll go to New England."

"I'm not looking for New England" -- Billy Bragg, almost

Data source: Wolfram Alpha, Wikipedia

Does this include city halls in Virginia? Cities are outside of counties there so you would either skip them or have to include them as if they were counties.

Now do the optimal version :P

Nice tool list. Why didn’t you add funky music in Resolve?

Is this a depth first search algorithm?

What's the most efficient path?

That's an open question in mathematics...

This is the Traveling Salesman Problem. The only way to know for sure if you have the shortest solution is to try every possibility, and that becomes computationally impossible when you have more than a certain number of points.

We'll probably never know

It’s knowable, but how much time do you have?

That was fascinating. I wonder whether different starting counties would converge to a similar path or whether you could get a different order entirely.

I didn't really try with other starting counties but I did consider doing that. I'm guessing you'd end up with fairly similar paths. I'm making one now that uses an optimized round-trip (closed-loop) path. That should be independent of starting county. It'll probably be done tomorrow.

Was this done on January 2, 1959?

And you still drove less than Lauren Boebert claimed she did in 2020

How many miles did she claim (for reimbursement I assume)?

Eureka! You've solved the wandering simpleton algorithm!

I read this in Professor Farnsworth's voice.

Why did I just sit there and watch that?

very cool

Gotta love a drunkard's walk

Wouldn't a drunkard's walk choose the next destination at random instead of choosing the closest not yet visited destination (as was done here)?

Ya. Maybe. Beats going back to the office!

For comparison does anyone know what a somewhat efficient solution would be?

The optimal path one algorithm got was 100,137 miles round trip. There's a link to what the path looks like in another comment. It looks much like what you'd think.

I don't think they're going to make their quota this month.

I'd call this "exhaustive meandering"

There is no county seat in Louisiana since they're called parishes here.

I'm very aware but I figured I'd not confuse the other 90% of the people with "State Administrative Subdivision".

I have truly never heard the term ‘county seat’ until I read this post.

Connecticut doesn't have county seats.

If no county seat, I used the largest city. Some counties in ND (I think) share a county seat with a neighboring county.

Hero's path mode, now included in DLC

can i get an optimal version of this?

https://imgur.com/uVS21ht.png

Isn't that how a simple greedy algorithms works?

I think it is. I’m a mechanical engineer so I have no idea names/labels are used.

This was satisfying as fuck

What a dumbass.

I dont like screen savers, but if this were an option I would select it.

Of course aroostook County in maine is the last one lol

Teacher asks me to draw U.S. map.

A worst solution would be to visit the furthest non visited county from the current one, i wonder how long that would be

But what about Hawaii and Alaska?

Well... driving to HI is difficult. And so is driving to much of AK.

Then shouldn't this be the shortest path through all county seats? Since every segment is the shortest path between adjacent seats?

No... this is FAR from optimal. I'm making an optimal one now since I found a nice algorithm for solving (approximately) the Traveling Salesman Problem with 3000 destinations.

FYI, the optimization gave a total distance of 100,137 miles, about 21k miles less than the naive approach here.

This is based on the idea of a greedy algorithm like Dijkstra's. It makes the most optimal LOCAL choice. But systemically that may not be the best over-all choice for an optimal route. It won't give you the best answer, but it'll generally give you a decent answer.

What's the fading red at the head of the path represent?

Nothing. Just gives an indication of the most recent path.

You visited Lousiana, which doesn’t have counties, but you didn’t visit Hawaii, which does have counties?

LA has the equivalent to counties. If there was a way to drive to HI, I'd have included it. Same with AK... there are some "counties" there that don't seem accessible by car.

You should run this starting in each location and then sort them by distance traveled. I'd be really curious to see the shortest and longest.

Doing that for the geographic distance would be possible, but I've been using the travel distance here. Getting the turn-by-turn directions between 3000 locations takes some time. Lol.