WDM GamesWDM Games

The History of the Word Ladder Puzzle

Published September 17, 2026

Word Ladder traces back to a game Lewis Carroll, the author of Alice in Wonderland, invented on Christmas Day 1877 for two teenage sisters who complained they had nothing to do. He called it "Word-Links" at first, later renaming it "Doublets" when he published a series of the puzzles in Vanity Fair magazine in 1879. The core rule he wrote down that Christmas is exactly the rule the puzzle still runs on almost 150 years later: change one letter at a time, and every step has to be a real word.

From a bored Christmas afternoon to a magazine puzzle

Carroll's most famous example turns HEAD into TAIL in five steps: HEAD, heal, teal, tell, tall, TAIL. Every one of those intermediate words has to be real, which is precisely the constraint that makes the puzzle interesting rather than trivial, and precisely the rule this site's own Word Ladder still checks on every move you submit. The name "Doublets" itself wasn't Carroll's first choice; he borrowed it from a line in Shakespeare's Macbeth once the puzzle went from a private game to a public one in Vanity Fair.

Why the rules have barely changed since then

Most puzzle formats from the 1800s have been reworked or abandoned, but Doublets survived almost unedited because its one rule already does all the necessary work. Requiring a real word at every step is enough on its own to force genuine thought at each move, so there was nothing obviously missing to fix. The puzzle's difficulty comes entirely from vocabulary and the shape of the word graph between two points, not from any added mechanic later versions might have needed.

The same idea shows up well outside puzzle books

The mathematical structure behind a word ladder, changing one letter at a time along a chain of valid words, is the same structure computer scientists study as a shortest-path problem on a graph, where each word is a point and a link connects any two words one letter apart. That's not a coincidence dressed up after the fact: it's the same problem in two different costumes, which is part of why the puzzle has aged so well. A structure that maps cleanly onto real graph theory doesn't run out of genuine challenge the way a purely arbitrary rule set eventually does.

A puzzle built to always have a genuine answer

Because it's fundamentally a path-finding problem, a word ladder puzzle either has a solution or it provably doesn't, there's no ambiguous middle ground the way there can be with some wordplay formats. Word Ladder on this site takes advantage of exactly that: every puzzle's start-to-target pair is hand-verified solvable before it's ever shown to a player, the same guarantee Carroll's original doublets were built around from the start.

If the wordplay side interests you more than the puzzle-solving side

Word Scramble is a much newer format by comparison, built around recognizing a word from its shuffled letters rather than transforming one word into another. Pattern-based reasoning shows up outside words entirely too: Number Sequence Puzzle asks you to spot the rule connecting a set of numbers, a different kind of structure-spotting than a word ladder, but built on the same underlying instinct.

Frequently Asked Questions

Who actually invented the word ladder puzzle?

Lewis Carroll, better known for Alice in Wonderland, invented it on Christmas Day 1877 for two bored teenage sisters. He called it "Word-Links" at first, then renamed it "Doublets" when he published it in Vanity Fair magazine in 1879.

What is Carroll's most famous example?

Turning HEAD into TAIL in five steps: HEAD, heal, teal, tell, tall, TAIL, with every intermediate word required to be real.

Why hasn't the puzzle format changed much since then?

The single rule Carroll set, that every step must be a real word, already forces genuine thought on its own. There wasn't an obvious gap later versions needed to fill.

Is a word ladder actually related to computer science?

Yes. The same structure, moving between words that differ by one letter, is studied as a shortest-path problem on a graph, where each word is a point and a one-letter difference connects two of them.

Does every word ladder puzzle actually have a solution?

It should, if it's built correctly. Because it's a path-finding problem, a given start-to-target pair either has a valid chain of real words connecting them or it doesn't, with no ambiguous in-between.

Try It Yourself