Crack the Letter Connection

Two tiny letter pairs can hide one neat machine. Spot what the machine does, and the missing pair almost builds itself... but only if you test BOTH letters.

A letter connection shows one complete pair changing into another. Imagine the alphabet laid out as numbered tiles: A is one, B is two, all the way to Z. First, compare the first letter on the left with the first letter on the right. Count the steps and notice the direction. Then check the second letters in exactly the same way. The rule must fit every shown move. It might be forward three, back two, or two different shifts for the two positions. Draw matching arrows, and label each jump. Do not invent a story about initials, names, or words. These letters are symbols, not clues from real life. Use only the alphabet pattern you can prove on screen. Finally, copy that same pair of moves onto the incomplete connection.

Let's work through an example. Complete this letter connection: A C is to D F as H J is to question mark. Which two-letter pair replaces the question mark? Start with A changing to D. On the alphabet strip, move forward: B, C, D. That is forward three. Now test C changing to F: D, E, F. Again, forward three. Both positions obey one clear rule. Apply forward three to H. Step through I, J, K, so H becomes K. Keep K in the first answer position. Then apply forward three to J. Step through K, L, M, so J becomes M. Put the results together in their original order: K, then M. The missing pair is K M. Check it backwards... K back three reaches H, and M back three reaches J. Every arrow agrees, so K M is the answer.

Find the moves in the complete connection, prove them on both letters, then repeat them in order. Trust the visible alphabet rule, not a made-up story. You can crack the next missing pair with confidence!