Case 22 · logic · Medium · About 5–8 minutes
Six short code slips have fallen from an archive envelope. The typist changed exactly one letter between successive codes, and every surviving slip belongs in the sequence.
Vale knows the beginning and ending. Can you restore the intervening order without inventing any missing words?

The recovered codes
LAMP, LIMP, LIME, LINE, LANE, LONE.
The typist’s rules
- Use each of these six codes exactly once.
- The first code is LAMP and the final code is LONE.
- Between neighboring codes, exactly one letter position changes.
- Letter positions cannot move. You may replace a letter, but may not insert, remove, or rearrange letters.
- Only the six listed codes are allowed. Dictionary knowledge supplies no extra steps.
Restore the complete six-code sequence. “One letter changes” means compare the two four-letter strings position by position. For example, two differences would be an illegal step even if both strings are ordinary English words.
The archive guarantees that no slip was duplicated or forged. The mystery is their order. A quick legal path to LONE is not enough if it leaves a recovered slip unused. The typewriter picture is decorative; its keys and blank papers do not encode a seventh code.
Hint 1 - reveal when you want a nudge
LAMP has only one legal neighbor among the other five slips. Follow the forced beginning.
Hint 2 - reveal when you want a nudge
LINE can connect directly to LONE, but doing so would leave LANE unused.
Reveal the solution and explanation
LAMP → LIMP → LIME → LINE → LANE → LONE.
LAMP can reach only LIMP by changing one position. With LAMP used, LIMP can continue only to LIME. LIME then forces LINE.
At LINE, both LANE and LONE are legal neighbors. But LONE must be the final code, and choosing it now would strand LANE. Therefore LINE must lead to LANE, which reaches LONE by changing its second letter.
The changes in the completed sequence affect positions two, four, three, two, and two respectively. Each step changes exactly one letter. All six slips appear once, and the required endpoints are correct.
The forced beginning leaves only the final two unused slips. Their endpoint requirement fixes their order. Thus the recovered sequence is unique, even though the graph of legal one-letter links contains a tempting shortcut.
Solve another: The Cabinet of Fifty Mysteries · Browse all 50 cases