Coded Language Cipher

Coded Language questions are one of the most satisfying types in OC Thinking Skills — once you understand the underlying rule, decoding the message becomes almost mechanical. Let's start with the most common and most teachable variant: the Caesar cipher, where every letter in the message was shifted forward by a fixed number of places.

Shift ciphers appear consistently across OC TS tests and are reliable marks for students who practise the technique. The rule is always the same: encoding shifts letters forward, so decoding shifts them back by the same amount. The only trap is the wrap-around near the end of the alphabet.

The examiner wants to confirm that you can reverse an encoding rule systematically. Given that letters were shifted +N places to encode, you must shift −N places to decode — and handle the alphabet wrap-around (e.g. D − 3 = A, C − 3 = Z) without losing track.

A ciphertext (a string of letters with no spaces) is given along with the shift amount. Spaces are removed before encoding, so you'll need to add them back by matching the decoded letters against the answer options. Sometimes two example words are given instead of the shift amount — you must deduce the shift by comparing them.

Now for a fundamentally different type of cipher — one that uses unfamiliar symbols rather than letters, and requires logical deduction rather than arithmetic. These symbol-attribute puzzles look overwhelming at first glance, but every single one follows the same three-move solution pattern.

Symbol-attribute identification questions sit reliably in the medium-to-difficult band of OC TS and appear in the second half of most tests. Students who know the "Newcomer + Link" algorithm solve them in about thirty seconds; students who don't can spend three minutes making no progress.

The examiner is checking whether you can perform a two-step deductive chain: first identify the brand-new symbol and assign it to the remaining category slot, then use the shared symbol across two clues to lock down the other category. Both moves are forced — there is exactly one valid answer.

Items are grouped by two attributes (e.g. colour × access level). Each item is stored in a container with exactly two symbols — one per attribute, in either order. You are shown two fully identified containers and one mystery container. The mystery container always shares one symbol with a known one and introduces exactly one brand-new symbol.