Travelling hashman achievement

This achievement was proposed in the past, but has been rejected, because of it being too difficult to achieve without a car. Please read the discussion page for more details.

As per the page proposed achievements: If an achievement has strong opposition and the reasons for opposition are not resolved through discussion, then the proposed achievements category is replaced with the rejected achievements category, the reason explained succinctly on the page, and the page otherwise marked to make sure it isn't confused with an achievements page.

The Travelling Hashman problem (THP) is a problem in combinatorial optimization studied by theoretical computer scientists and biological researchers watching migration patterns of local geohashers. Given a week's worth of retrohashpoints, the task is to reach all of a graticule's 7 geohash points (sunday through saturday inclusive) on the saturday ending the week. The points need not be reached in the order of occurance (ie, you do not need to end on the saturday point). You may not obtain this achievement if you have already visited any of those points during the week (Where's the fun in it if you've already been there? This doesn't stop you from joining/helping anyone else who is attempting it, however)

• Bonus points if you can prove that your route was in fact the shortest possible route to take to reach all points. This can be done either using the brute-force approach, or a more elegant method if you can devise one.

• Mega bonus points if you can prove that P = NP