Symbol Substitution and Language Puzzles

Overview

Symbol Substitution and Language Puzzles appears about 0.8 times per paper across the last four AFCAT solved papers, placing it in the solid add-on band of Reasoning and Aptitude.

Symbol substitution and language puzzles are the smallest named topic in the AFCAT Reasoning and Military Aptitude Test block. The paper carries 25 to 30 Reasoning questions in total, and across the recent solved papers only about 0.75 of a question per paper has come from this exact shape. That is roughly one question every alternate sitting. The topic is small, but it is also one of the most rewarding to drill, because the work per question is short and the accuracy ceiling is very high once a clean method is in place.

The format is narrow. Almost every item gives you a short renaming chain — "Red is called Blue, Blue is called Black, Black is called White" — and then asks for the new name of an everyday object, or it gives you an operator-swap rule — "if + means × and − means ÷" — and asks you to compute a small expression. A smaller number of items use day names, month names, or seasons in place of colours, and a still smaller set combines substitution with a one-step letter code. All of these reduce to the same protocol: write the table down, decide the direction, then translate.

This page treats the topic exactly the way an AFCAT candidate should treat it in the hall — as a thirty to forty-five second exercise that should never be done in the head. The cost of writing the table is far smaller than the cost of one wrong translation. Across the worked examples below you will see the same protocol applied to colour chains, operator swaps, day-of-week chains, multi-step renames, reverse translations and combined substitution-plus-coding items, so that no shape on the paper feels unfamiliar.

Why substitution puzzles reward strict bookkeeping

Substitution items look so simple that candidates routinely solve them in the head and then misread the chain by one step. The chain "Red is called Blue, Blue is called Black" has two directions baked into it, and the question can ask about either one. Working in the head also means juggling the everyday meaning of a word (the sky is blue), the substitution rule (Blue is called Black), and the final answer (the sky is called Black) all at once. Three things in working memory is one more than most candidates manage under timer pressure, and the wrong-answer choices are crafted to catch exactly the candidate who confused step two with step three.

Bookkeeping fixes this. The instant you draw a two-column table with "everyday name" on the left and "new name" on the right, the puzzle stops being a memory test and becomes a lookup. You find the everyday name of the object in column one, read the new name off column two, and pick that option. There is no second mental step to confuse and no chain to traverse in your head. The table also makes the direction visible — column one is always the old name, column two is always the new name — so you stop being able to translate the wrong way by accident.

The same logic applies to operator-swap items. "If + means × and − means ÷" is a four-row table in disguise. Write the four rows, then rewrite the expression with the new operators in place of the old, then evaluate using BODMAS. The single biggest source of wrong answers in operator-swap items is not the swap itself but forgetting that the new expression still has to be evaluated under standard order of operations after the substitution.

Renaming-chain puzzles and the substitution-table method

The canonical AFCAT shape is a colour-renaming chain followed by a real-world question. For example: "Red is called Blue, Blue is called Black, Black is called White, White is called Yellow. What is the colour of the sky called in this language?"

The protocol has three steps. First, write the chain as a two-column table. Second, identify the everyday-language answer to the real-world question (the sky is blue). Third, read the new name off the table (Blue is called Black, so the answer is Black).

The substitution-table template

Applied to the sky example

The sky in everyday language is Blue. Underline the second row of column one. The matching entry in column two is Black. The answer is Black. Notice that you never traversed the chain — you did one lookup.

The same template works when the chain has five or six clauses. The only thing that grows is the table. The thinking does not.

Operator substitution and BODMAS after the swap

The second common shape is an operator swap. The question gives you a rule like "if + means ×, − means ÷, × means + and ÷ means −" and then asks you to evaluate a small expression such as 4 + 2 − 1 or 12 ÷ 4 × 3 + 2.

The trap is double. First, candidates apply the swap in the wrong direction (using the new symbol instead of replacing the old). Second, even after the swap is done correctly, they ignore BODMAS and evaluate strictly left-to-right, which produces a different number.

Operator-substitution swap table

Worked rewrite

Take 12 ÷ 4 × 3 + 2 under the rule above. Rewrite each symbol using the table:

• 12 ÷ 4 becomes 12 − 4
• × 3 becomes + 3
• + 2 becomes × 2

So the expression becomes 12 − 4 + 3 × 2. Now apply BODMAS. Multiplication first: 3 × 2 = 6. Then left-to-right: 12 − 4 + 6 = 14. The answer is 14, not the 16 you would get by evaluating left-to-right without BODMAS.

Letter substitution with a fixed rule

A letter-substitution item maps each letter of the alphabet to another by a fixed rule — for example, every letter shifts forward by three positions, or every vowel is replaced by the next consonant. The question then gives you a short word in the new alphabet and asks for the original, or vice versa.

The method is to write a two-row strip — the original alphabet on top, the substituted alphabet underneath — for as much of the alphabet as the question touches. You do not need all 26 letters; only those that appear in the stem and the options. Once the strip is written, the puzzle is a column-by-column lookup, identical to the colour table.

Worked example of the strip

Rule: shift every letter forward by 4. Word in the new alphabet: LIVI. What is the original?

Reading L in the shifted row maps back to H in the original. The same lookup gives I → E, V → R, I → E. The original word is HERE.

The protocol generalises to vowel-only swaps (write only the vowels), reverse-alphabet substitution (A becomes Z, B becomes Y), and shift-by-N rules. In every case the strip removes the in-head counting that is responsible for the bulk of letter-substitution errors.

Day-of-week, month and season renaming chains

Less common than colour chains but identical in method: "Monday is called Tuesday, Tuesday is called Wednesday, Wednesday is called Thursday…" followed by "if today is Wednesday in everyday usage, what is it called in this language?"

Two micro-traps appear in this shape and nowhere else. First, the candidate translates the day of the week given in the question through the chain, rather than translating the everyday-language answer through the chain. The everyday-language answer here is Wednesday, and the chain says Wednesday is called Thursday. The answer is Thursday. Second, day-of-week items sometimes ask "if today is X, what day will it be the day after tomorrow?" — in that case do the calendar arithmetic in everyday usage first (Wednesday plus two days is Friday), then translate Friday through the chain.

Common renaming-chain patterns

In every row of that table the protocol is identical: build the table, find the everyday-language answer, then read the new name.

Everyday-object renaming and translating through the chain

The object variant looks like this: "If sky is called ground, ground is called water, water is called air, air is called cloud, then where do birds fly?" The everyday-language answer to "where do birds fly" is the sky. Translate through the chain: sky is called ground. The answer is ground.

This shape is widely loved by question setters because the wrong-answer choices nearly always include the everyday-language answer itself (sky) as a distractor. A candidate who reads the question quickly and forgets that the answer must be translated will mark sky and lose four marks on the swing. The fix is to make the translation step explicit on paper: write "real-world answer = sky", then "in this language = ground", then mark ground.

The harder variant adds a sentence that makes the question feel like a riddle. For example: "If river is called lake, lake is called ocean, ocean is called stream, where does the boat sail?" The everyday-language answer is open — a boat sails in many places. The setter expects you to take the most natural answer (river or ocean) and translate. If you take river, the answer is lake. If you take ocean, the answer is stream. Both are usually present as options. Read the question once more: does it say "where does the small fishing boat sail" (river) or "where does the ship sail" (ocean)? The detail that disambiguates is always there, and the table makes the final mapping mechanical.

Multi-step substitution across two or three swaps

Some items give you two rules in one question — for example, a colour chain plus a separate rule that says "in addition, every colour is then translated into its initial letter". The puzzle becomes a two-pass translation: pass one is the colour chain, pass two is the colour-to-letter map.

The protocol is to keep two separate tables, and to translate the everyday-language answer through them in the order the question specifies. If the order is colour chain first, then colour-to-letter, then for "the colour of the sky" you write: sky → blue (real world) → black (chain) → B (initial-letter pass). If the order is reversed in the stem, swap the two passes.

The most common multi-step shape on AFCAT is much simpler: it is just a chain with five or six clauses instead of four. The protocol does not change — the table grows by one or two rows. The thing to watch for is a single clause repeated for emphasis (some setters write "Black is called White, White is called Yellow, Yellow is called Black" to create a loop). If you see a loop, do not panic: just follow the rule the question gives you and stop after one application.

Reverse substitution — asked what maps to the given word

The reverse-substitution shape inverts the usual direction. Instead of asking "what is the sky called in this language", it asks "what is called blue in this language". The answer is the old name in column one that maps to Blue in column two.

If the table is well laid out, this is again a single lookup — just on the opposite column. Find Blue in column two (it is the new name for Red), then read Red off column one. The answer is Red.

The trap in reverse items is to read the original direction by reflex and translate Blue forward (Blue is called Black, so answer Black). The wrong answer Black is always present as a distractor. The fix is to underline the column-two entry, not the column-one entry, and read across to column one. The two-column table is precisely what makes that switch visible.

An adjacent shape is "what is the colour of grass called in this language". Here grass is green in everyday usage; if green is not in the chain at all, the answer is simply green (the chain only renames the colours it lists, and any colour not in the chain keeps its everyday name). Candidates frequently invent a rename for green when none exists, then mark a wrong colour. The table catches this: if green is not in column one, there is no row to read, and the answer is green.

Substitution combined with a coding step

A small share of AFCAT substitution items combine a renaming chain with a one-step letter code — for example, "Red is called Blue, Blue is called Black… and in this language each colour is also written using its letters shifted forward by two. What is the sky called?"

Handle this in two passes. Pass one is the chain (sky → blue → black). Pass two is the code applied to the chain output (black with each letter shifted forward by two becomes DNCEM). Write each pass on its own line so that you do not lose track of where you are.

The combined shape is rare on AFCAT but worth recognising because it appears in the model papers and in some 2024 sittings. The total time should still be under 60 seconds, because each pass on its own is mechanical.

Common AFCAT trap patterns and how to neutralise them

Across the solved papers, three traps account for almost every wrong answer on substitution items.

Trap patterns

The single best defence against all five is the two-column table, drawn before reading the question stem in full. The table fixes the direction; the question then fills in which row matters.

Drawing a substitution-table protocol you can use under timer

The recommended on-paper protocol is small and quick:

1. Five seconds. Draw a two-column box. Label column one "old" and column two "new".
2. Ten seconds. Read the chain once, writing one row per clause as you go.
3. Five seconds. Read the question. Identify the everyday-language answer (sky = blue, today = Wednesday, what we drink = water).
4. Five seconds. Underline that entry in column one. If it is not in column one, the answer is the entry itself.
5. Five seconds. Read across to column two and mark the option that matches.

That is thirty seconds, well within the per-question budget. For operator-swap items the timing is similar — five seconds to write the swap table, ten to rewrite the expression, fifteen to evaluate under BODMAS — and again finishes inside thirty to forty-five seconds.

Two practical points. First, never erase the table. If the next Reasoning question is also a substitution, the previous table still occupies space and that is fine; cramped rough sheets are not the problem in AFCAT. Second, never trust an internal voice that says "I can do this one in the head". The voice is reliably wrong about every fourth item, and at −1 per error the cost compounds quickly.

Time budget for substitution items in the AFCAT paper

AFCAT gives you 120 minutes for 100 questions, an average of 72 seconds per item. Reasoning items, taken as a block, run a little faster than that average because the figure-based ones are quick. Within Reasoning, substitution items should be among the very fastest.

Recommended budget

If any item is taking more than 75 seconds, leave it, mark it for review, and return to it in the buffer at the end. AFCAT does not reward sunk-cost stubbornness; it rewards a clean accuracy rate across the items you do attempt.

How to drill substitution items in the run-up to the paper

Because the topic carries less than a single mark per paper on average, you should not over-invest. A reasonable plan is two thirty-minute sessions in the fortnight before the paper, each covering twenty mixed items (ten chain, eight operator swap, two reverse or combined). That is enough to make the table-and-lookup protocol automatic without spending time that should be going to coding-decoding, series, or direction sense.

Inside each session, drill the protocol, not the answers. The point of practice is not to memorise that the sky is blue or that Wednesday is the middle of the week; it is to make drawing the two-column table a reflex that triggers the moment you see a chain. Once the reflex is in place, accuracy goes from around 70 percent (in-head solving) to near 100 percent (table solving) with no extra time cost.

For operator swap items specifically, run a few BODMAS-only refreshers alongside the substitution work. The skill is not the swap; it is the order-of-operations check after the swap. Five minutes a day on standard BODMAS expressions for a week pays disproportionate returns on this topic and also on the series and the matrix-and-missing-number-grids items elsewhere in Reasoning.

Worked AFCAT-style examples

Exam-day strategy

1. Draw the two-column substitution table before reading the question stem in full. The table fixes the direction so you cannot translate the wrong way.
2. Identify the everyday-language answer first (sky = blue, hottest season = summer, today = Wednesday). Then translate it through the table exactly once.
3. If the everyday-language answer is not in column one, the answer is the everyday-language word itself. Do not invent a translation.
4. For operator-swap items, rewrite the entire expression with the new operators before evaluating. Never evaluate symbol-by-symbol.
5. After every operator swap, apply BODMAS. Scan the rewritten expression for × and ÷ and handle those before the + and −.
6. For reverse-substitution items, underline the column-two entry rather than the column-one entry, and read across in the opposite direction.
7. For combined substitution-plus-coding items, run the two passes on separate lines so that you can see where each pass ends.
8. Budget thirty seconds for a single-pass item, forty-five seconds for an operator swap, and sixty seconds for a combined item. Leave anything that runs past seventy-five seconds and return to it in the buffer.
9. Never solve a substitution item in the head. The cost of writing the table is five seconds; the cost of one wrong answer is a four-mark swing.
10. Drill the protocol, not the specific puzzles. The reflex of drawing the table is what carries you through any new chain on test day.

Frequently asked questions

Related topics