Greenbeard was a cautious lizard and had already tried to find a suitable location to hide their treasure on Martinique before being attacked by the Seahawks.

His journey was documented in a map located in his journal. There are multiple places identified that were considered as suitable locations.

I don’t think any of these are the final resting place of his treasure, but it might help us if we can find out the route he took in his travels.

So, using this KML dataset, determine the shortest route Greenbeard could have taken to visit all of these locations.

• Greenbeard’s journey must visit all locations.
• There is no fixed start or end. He can start and finish at any point.
• All journeys are from one point to another. No road network is needed.
• Lizards can only travel in straight lines! No-one knows why!
• Lizards can’t swim, so routes cannot pass over the coastline.

Each location has an ID letter, such as P, C, or M. Put the letters in order of the best route - for example, FRCMAPHGUQOY - and enter it into the field below.

If you are correct, I’m sure a new clue will reveal itself to you!