# The Travelling Presidential Candidate Map

While working on the ZIPScribble map, I started to wonder how to untangle the beautifully scribbly lines, and finding the shortest path through all ZIP codes. In computer science, this is called the Travelling Salesman Problem (TSP), and so I decided to make this the Travelling Presidential Candidate Map.

The TSP is a very hard problem to solve, and would have taken forever for the over 37000 points on the map, even when using a very efficient algorithm. So I had the idea of using a Hilbert curve to get an approximation. A Hilbert curve is a recursive space-filling curve that provides a linear path through all locations in a square. Here is one level of it, in the next level each line segment is replaced by a more coplex curve, etc.

I was not the first one to have the idea of using a Hilbert curve for this task, and the existing work shows that this solution is typically only 75% optimal. But that is good enough for my purposes, and it proved quick enough to implement and run a rather naive implementation of (about 10 minutes on a 1.67GHz Apple PowerBook).

The Travelling Presidential Candidate Map (TPC) does not look nearly as interesting as the ZIPScribble. There are hardly any crossing lines, which makes the image appear a lot lighter and less interesting. It also loses quite a bit of the information in the original map, which nicely showed the borders between clusters of ZIP codes, which also defined state borders.

It does gain from adding more information though, like coloring the states. Its slightly flimsy appearance does not change, however. The thin lines also make it harder to see the colors, especially in the small “thumbnails” on this page.

Finally, the map with the added borders to better see where the path crosses state lines. This is not quite as interesting as with the ZIPScribble map, since there are no emergent patterns, but still.

This map is a lot more technical and lacks the slightly artsy appearance of the ZIPScribble Map. It does gain from added information, quite in contrast to the other one. The path through all ZIP codes is – not surprisingly – not all that interesting. If you are running for president, you might find it useful, though.

After a comment below, I calculated the actual savings of the TPC Map as compared to the standard ZIPScribble Map.

## 3 responses to “The Travelling Presidential Candidate Map”

1. fatbear

Another great one!

This time there are a few more straight line artefacts:

VT/NH border into MA then CT – Connecticut River

Eastern NY – Hudson River

Biggest one: line starting in eastern OH (on Lake Erie), going down through WV, VA, NC, SC and ending in SC

Surprisingly you x-crossed the other IL/IN, KY, TN line – just shows that travel broadens the mind

btw, one other thing I didn’t see in the other map – the WV/OH combination also includes western MD – those hill people are weird

2. Anonymous

You found the shortest path…but how long (or short) is it? Frequent flyer miles hang in the balance…

3. Robert Kosara

Thanks for asking, I did the math.