Travelling hashman achievement

This is a proposal made on 2009-06-15. Please leave comments and suggestions on Talk:Travelling hashman achievement, indicating your thoughts on the proposal, including:

• Support - you think this proposal should be added with zero or minor changes
• Do not oppose - you think it's boring/meh/not for you, but it wouldn't harm to have it created
• Oppose - you have a specific reason as to why this ribbon should not exist (state this reasoning in your comment)
• Needs work - you think the achievement should be created after more significant changes have been made

See Proposed achievements for more information on this process.

The Travelling Hashman problem (THP) is a problem in combinaltorial 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