Here's an easy puzzle you can solve in your sleep -- well, almost in your sleep. Please don't ask me for a hint. Please don't ask any of your fellow caching friends for a hint. And please don't offer any hint to any of your caching friends. In fact, you should be able to figure this out just once and then never have to look at it again. Yeah, really. Don't look at it again. It's that easy! Just follow my instructions.
Select ANY of the numbers ONE through TWELVE. Doesn't matter which one. Just whatever comes to mind. Now, starting at the top (TWELVE) count (or move) CLOCKWISE one position for each letter in the random number you selected. For example, if you chose TEN, then move to ONE for T, then to TWO for E, and finally to THREE for N. Now, starting at where you just ended, count (or move) clockwise one position for each of the letters that you are currently at. So in the above example, you landed on THREE, and THREE has five letters, so now count (or move) five letters for each letter in THREE. Now do that one more time, starting at the location you just landed on. You can now look for the cache at your final location.
You can validate your puzzle solution with certitude.