This challenge is to find one cache for each letter of the alphabet (e.g., A = AC/DC, DDDDC, Track 3, B = Blackberry, C = Clueless in CT: Litmus Test, etc.). You don’t have to do them in any particular order. The only requirement is you do one cache for each letter of the alphabet.
To make this a true challenge, caches must start with the actual letter it is representing. As in the example: "A Walk in Two Parks" would only count for the letter "A". Therefore, "The X Marks the Spot" would only count for the letter "T" not "X", see? That’s not going to be difficult. Now is it? You might not even have to use very much gas if you plan it right. All it will take is a bit of searching and recordkeeping.
Below are the guidelines.
- Find a cache for each letter of the alphabet.
- This cache will not count as your "A" find, so you will need another "A" cache to fulfill the requirements.
- All cache types are accepted.
- No finds before the published date of this cache (10/27/14) will count.
- [As of August, 2017] You must use this nifty Project-GC challenge checker to see if you qualify for the challenge and which generates a verifiable list.
- Copy and paste into your log the generated text under Example log (not Script output) as proof that you completed the challenge.
- Have fun!
While you can find the cache without completing the requirements above, should you choose to log it as found without completing the challenge correctly your log will be deleted. We want to preserve the honor of "finds" for those who earned it.
Have fun! Try to add some fun and a twist to caching.