About time computers did something useful.

Pro tip: pee before that drive across Montana.

Nerds and their big data algorithms have made spying on Americans wherever they go a snap, so it's about time they figured out a way to make our heavily monitored travels more enjoyable. That's what big ol' nerd and self-described "data tinkerer" Randy Olson did with his big ol' nerd brain and big nerd algorithms: he plotted out the best possible road trip across America.

Well, two best possible road trips. One is the best possible version of a trip focusing on landmarks, historic sites and monuments, and the other takes you to America's top-ranked cities. What makes these the "best"? Well, in addition to hitting 50 awesome stops in each version, this algorithm solved what's called the "traveling salesman" problem—how to visit each spot in the fastest time without retracing your steps. They included (as any good Internet denizen should) a relevant XKCD comic to help explain: