Indexing

Indexing is a common extraction method used in hunt puzzles. It involves using particular numbers to select the Nth letter of a given string of letters. It is likely the most common extraction method across all puzzle hunts currently in existence, due to its versatility and ease of accessibility, especially to new solvers.

Puzzle Application

At a basic level, indexing is very simple. Numbers can be paired with words or phrases in order to extract individual letters from each. For example, if a certain index is 6, then one would count 6 letters into the word/phrase/string and write down that 6th letter.

Shopping List: 2 Bananas, 12 Hamburger Buns, 5 Radishes, 1 Watermelon, 4 Live Chickens, 3 Parsnips
BANANAS (2), HAMBURGER BUNS (12), RADISHES (5), WATERMELON (1), LIVE CHICKENS (4), PARSNIPS (3) --> ANSWER

These numbers can be pre-paired with the strings as seen above, or they can be presented at the outset of the puzzle and paired up through the course of solving. A common example of this is two sets of clues, with one having indexes attached to them and the other not, resulting in pairing up clues and indexing into the half that didn't start with an index. Indexes may even have to be wholly determined through additional steps, providing an additional level of obscurity to the indexing revelation. One way to do this is by having answers associated with particular numbers, and being indexed into by their appropriate number.

SNIVY TYPHLOSION RILLABOOM IVYSAUR FROGADIER

Each pokemon gets indexed by its local pokedex number: SNIVY (1), TYPHLOSION (6), RILLABOOM (3), IVYSAUR (2), FROGADIER (8) --> SOLVE

There's also what has been called an "implied index", which is when a consistent index or series of indexes is applied to a set of information without ever being explicitly written down. This includes initialization (index of 1), diagonalization (increasing index of 1, 2, 3, etc.), and (debatably) centralization/terminalization. The latter two are debatable due to having the implied index change depending on the length of the answers in question, which makes it harder to "imply" via consistency.

Strategy

The action of indexing requires very little strategic thought. Two elements of indexing, however, have the tendency to make problems for solvers.

Is It An Index?

Whether or not a particular number or set of numbers found in a puzzle is actually meant to be used as an index can be a difficult question to answer, particularly if there are a lot of different sets of numbers being thrown around.

One common confusion can be whether numbers presented after clues are indexes or enumerations. An easy way to differentiate them is to remember that indexes will usually be single numbers. If any of the clues is followed by two number separated by a space, it's likely that it's an enumeration for a two-word phrase, and the rest should be treated as enumerations as well. Alternatively, if the clues are actually solved and end up being the same lengths as the numbers, it's likely they're enumerations rather than an overly-signposted terminalization extraction.

When presented with multiple numbers for a given set of information, it can be difficult to know which number is an index, if any of them are. Since indexes can't go beyond the length of their given string, this can sometimes be used to narrow down possible index number sets. If any of the numbers in a set can't be used as an index on its respective string, then it's unlikely any of the others will be used either. It is possible that the string is incorrect, so make sure to double-check your answers and your numbers to make sure you're not excluding anything that shouldn't be excluded.

What Gets Indexed?

When a puzzle provides a lot of streams of information and expects solvers to index into a specific subset of that information, it's very easy to get confused. A good example of this is music identification puzzles, in which each track has a title artist, and track that have the possibility of being used.

One of the strategies to deal with this problem is the same as one used for determining which set of numbers to use as indexes when presented with multiple. If a set of known indexes contains numbers too large to index into one of your data sets, then it's likely that it's not meant to be indexed into. As before, it's still possible either the indexes or the strings are incorrect, but that's what double-checking is for.

Since this kind of situation is unlikely to be caused without a way to more reliably determine the correct path, taking note of the different streams of information and the extent to which they've been used during the rest of the puzzle is a good idea. Information is usually used somewhat equally throughout a puzzle, and if a piece of information hasn't been used at the time of indexing, it's likely that that information will be used either during indexing or for an unknown step beyond indexing. Either way, it'd be wise to confirm which is the case.

Notable Examples

• TO DO

See Also

• Puzzles that use Indexing
• Index Adjustment - When indexes are changed during the course of a puzzle, and used both before and after the change is made.