Travelling hashman achievement
- Support the proposal
- Do not oppose it
- Oppose (this option requires you to watch the page and return to comment on modifications), or
- Think it Needs work before you can decide.
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
