Decode the letter rule

Check a letter rule against every example, including where the alphabet wraps around.

Compare letters in the same position

1 of 4

MNIJNOTU
MINT becomes NJOU when every letter moves one place forward.

An input code changes into an output code. At level 1, the same shift moves every letter forward or backward through A–Z. A shift is one, two, three or four places.

Compare M with N: that is one place forward. I becomes J, N becomes O and T becomes U. The same change fits all four positions.

These are letter codes; their outputs need not be words. Use the rule stated for the level, rather than searching for a word meaning.

Lesson help

Find a permitted rule, check it against every example, then apply it letter by letter. Wrap between Z and A when needed.

About this lesson

Try the method in a practice when you are ready.

Report

Compare letters in the same position

An input code changes into an output code. At level 1, the same shift moves every letter forward or backward through A–Z. A shift is one, two, three or four places.

Compare M with N: that is one place forward. I becomes J, N becomes O and T becomes U. The same change fits all four positions.

These are letter codes; their outputs need not be words. Use the rule stated for the level, rather than searching for a word meaning.

MNIJNOTU
MINT becomes NJOU when every letter moves one place forward.

Test the rule, including the wrap

The three examples all use the same rule. MINT becomes NJOU and PARK becomes QBSL. In ZANY, Z wraps to A, A becomes B, N becomes O and Y becomes Z: the output is ABOZ.

Wrapping works in both directions: one place forward from Z is A; one place backward from A is Z. Continue counting instead of stopping at the end of the alphabet.

Level 2 alternates two different shifts from the first letter. Level 3 reverses the letter order, then applies one shift. Every shift is still one to four places forward or backward. Only that level’s rule family is allowed.

MNIJNOTUPQABRSKLZAABNOYZ
Check every example: all letters move one place forward, with Z wrapping to A.

Apply the same rule to a new code

Use the rule from the three examples: move every letter one place forward. What does FROG become?

Work through F, R, O and G in order. Check each position before choosing; a familiar-looking ending is not enough.

This checkpoint has two choices. In the practice, each of six questions gives three examples and four answer choices. You can take your time.

F?R?O?G?
A new input, FROG, with its four output letters hidden.

Try it

What does FROG become when each letter moves one place forward?

  1. GSPH
  2. EQNF
Show the answer

GSPH

Correct. F becomes G, R becomes S, O becomes P and G becomes H. GSPH follows the same one-place-forward rule in every position.

Enable JavaScript to answer interactively and save your place.

Practice Coding-decoding