Xkcd dating algorithm
This means finding the route that backtracks as little as possible, which is especially difficult when visiting Florida and the Northeast.
If you read my Where’s Waldo article, you’re already aware of how difficult it can be to solve route optimization problems like this one.
With 50 landmarks to put in order, we would have to exhaustively evaluate 3 x 10 years — long after the Sun has entered its red giant phase and devoured the Earth.
It is a rather big island, with an area size of about 1.1057 hectares.
Last week, Tracy Staedter from Discovery News proposed an interesting idea to me: Why not use the same algorithm from my Where’s Waldo article to compute the optimal road trip across every state in the U. The result was an epic itinerary with a mix of inner city exploration, must-see historical sites, and beautiful natural landscapes.
One of the hardest parts of planning a road trip is deciding where to stop along the way. To stand a chance at making an interesting road trip, Tracy and I laid out a few rules from the beginning: With those objectives in mind, Tracy compiled a list of 50 major U. landmarks — one in each state excluding Alaska/Hawaii and including D. Tracy wrote about that process on Discovery News here.
Out of the top 400 recommended cities to visit on Trip Advisor, none were from North Dakota, Vermont, nor West Virginia.
This is especially interesting because Trip Advisor reviewers recommend cities like Flint, MI — the 7th most crime-ridden city in the U. — over any city in North Dakota, Vermont, and West Virginia.