Play Word Ladder Online
COLD becomes WARM in four steps. COLD, CORD, WORD, WORM, WARM. Each step changes one letter. Every intermediate word must be real. Lewis Carroll invented this puzzle on Christmas Day 1877. Play it free right here, no downloads.
Lewis Carroll's Christmas Day Invention
On Christmas Day 1877, two young girls told Lewis Carroll they had nothing to do. Carroll, the Oxford mathematician and author of Alice's Adventures in Wonderland, set about devising what he called a new form of verbal torture. The result was Word-Links, later renamed Doublets. He first mentioned it in his diary on March 12, 1878, and published it as a weekly column in Vanity Fair starting March 29, 1879.
The rules are simple. Two words of the same length are proposed. You must link them by interposing other words, each differing from the next by exactly one letter. The letters must not be rearranged. Each must stay in its position. Carroll's own example: HEAD becomes TAIL through HEAL, TEAL, TELL, TALL. Four links. Five steps total.
Carroll ran the column as a competition. Readers submitted solutions by post. He awarded marks based on chain length, deducting a point for every extra link beyond the minimum. He published a leaderboard. This was 1879. The first competitive puzzle community operated through the postal service.
A 2014 study published in PLOS ONE analyzed nearly 60,000 English words as a network where words are nodes and edges connect words differing by one letter. The study found that this network, called the Doublets net, has computable multiscale structure. Short words form dense clusters. Long words scatter into isolated fragments. The language's efficiency and redundancy are visible in the graph topology.
How to Play Word Ladder
You get a start word and a target word. Same length. Change one letter at a time. Every step must be a real word.
- A starting word and target word of the same length are displayed
- Type a new word that differs from the previous word by exactly one letter
- Press Enter or click Submit to validate
- The word must be a real English dictionary word
- Only one letter position can change per step
- Continue until you reach the target word
- Use Undo to backtrack and try a different path if you hit a dead end
Your step count is your score. Lower is better.
Rules at a Glance
- Change exactly one letter per step
- The changed letter can be in any position
- Every step must form a valid English word
- Word length stays the same throughout the ladder
- Letters cannot be rearranged, only replaced
- No word can be repeated within the same ladder
- The puzzle is solved when you reach the exact target word
Graph Theory for Word Players
Computer scientists solve Word Ladders using breadth-first search (BFS) on a graph where words are nodes and edges connect words that differ by one letter. The shortest path through the graph is the optimal solution. You do not need to know the algorithm to play well. But the principles it uses map directly onto human strategy.
- Count the differences first. The Hamming distance between start and target sets the theoretical minimum. COLD and WARM differ in three positions. The minimum is three steps. Carroll's published solution took four because no three-step path exists through common English words.
- Route through hubs. CARE connects to BARE, DARE, FARE, HARE, RARE, WARE, CORE, CURE, and more. Hub words have high degree in the graph. Passing through a hub opens multiple onward paths and reduces the chance of dead-ending.
- Change flexible letters first. Vowels and common consonants like T, R, S, N create the most neighbors at each step. Changing a Z or Q limits your options because few words contain those letters.
- Work from both ends. Think forward from the start and backward from the target. If both paths reach a common word, you have your chain. This is bidirectional BFS, and it is how efficient solvers operate.
- Steer toward common patterns. Words ending in -ATE, -INE, -OOK, or -ORE have many neighbors. Words ending in -XE or -WL have almost none. The pattern you move toward determines how many options you have at the next step.
The PLOS ONE study found that path length correlates with the number of syllables. One-syllable pairs like DIVE and WIPE connect in two steps. Two-syllable pairs like DIVER and WIPER need six. Longer words have denser redundancy, which creates heavier selection pressure on the graph.
Three Ladders, Three Lessons
Ladder 1: The Optimal Three-Step
Start: CAT. Target: DOG. Hamming distance is three. You change A to O: COT. Change T to G: COG. Change C to D: DOG. Three steps. Three changes. Every intermediate word is real. This is an optimal solution. Not every puzzle lets you match the Hamming distance, but when you can, the ladder feels inevitable in retrospect.
Ladder 2: Carroll's Own HEAD to TAIL
Start: HEAD. Target: TAIL. Hamming distance is four. Carroll's published solution: HEAD, HEAL, TEAL, TELL, TALL, TAIL. Five steps. One more than the minimum. The extra step comes from changing the third letter twice (A to L in HEAL, then L to L in TELL is not a change, so the actual path shifts the A to E to L across two steps). Even the inventor could not always match the theoretical minimum.
Ladder 3: The Hub Route
Start: WARM. Target: COLD. You could try changing letters randomly. Instead, you route through a hub. WARM to WORM (A to O). WORM to WORD (M to D). WORD to CORD (W to C). CORD to COLD (R to L). Four steps. The hub WORD opened paths to CORD, LORD, FORD, and more. Steering through the hub gave you options at every step.
Variations of the Format
Word transformation puzzles come in several forms.
- Classic Doublets. Carroll's original. Two words, shortest chain wins. No timer. Pure vocabulary and planning.
- Timed Ladder. Solve against a countdown. The pressure forces quick decisions and tests vocabulary retrieval speed, not just depth.
- Long Ladder. Five-letter or six-letter words. Longer chains, more planning, deeper vocabulary required. The PLOS ONE study showed that longer words have sparser graphs, making these puzzles genuinely harder.
- Reverse Ladder. You get the complete path with some words missing. Fill in the blanks. Tests pattern recognition rather than generation.
Word Ladder Difficulty by Length
| Mode | Word Length | Difficulty | Typical Steps |
|---|---|---|---|
| Short | 3 letters | Easy | 2 to 4 steps |
| Classic | 4 letters | Medium | 3 to 6 steps |
| Extended | 5 letters | Hard | 4 to 10 steps |
Frequently Asked Questions
Why did Lewis Carroll invent Word Ladder on Christmas Day 1877?
Lewis Carroll invented the puzzle on Christmas Day 1877 for two young girls, Julia and Ethel Arnold, who told him they had nothing to do. He originally called it Word-Links. The first mention in his diary appeared on March 12, 1878. He renamed it Doublets and published it as a weekly column in Vanity Fair starting March 29, 1879. Readers submitted solutions by post and Carroll kept a leaderboard of step counts.
What is the Hamming distance and how does it relate to Word Ladder?
Hamming distance is the number of positions at which two words of equal length differ. CAT and DOG differ in all three positions, so their Hamming distance is three. This sets the theoretical minimum number of steps. In practice, the true minimum is often higher because not every intermediate word exists. Computer scientists solve Word Ladders using breadth-first search on a graph where words are nodes and edges connect words differing by one letter.
What is a hub word and why does it matter?
A hub word connects to an unusually large number of other words through single-letter changes. CARE connects to BARE, DARE, FARE, HARE, RARE, WARE, CORE, CURE, and more. Steering your ladder through a hub opens multiple onward paths and often reduces your total step count compared to committing to an isolated word.
Can every pair of English words be connected in a Word Ladder?
No. The English word graph is not fully connected. Some words exist in isolated clusters with no chain to certain other words. A 2014 study published in PLOS ONE analyzed nearly 60,000 English words as a network and found that the graph fragments into disconnected components as word length increases. Every puzzle on Wordic Games is verified to have at least one valid solution path before publishing.
How do you avoid dead ends?
A dead end occurs when you reach a word with no valid single-letter neighbors except words you have already used. The most common cause is moving toward uncommon letter combinations. Words ending in -XE, -WL, or starting with double consonants like PH or GN have fewer neighbors. Before committing to a step, count how many valid words you could reach from that position. Words with common patterns like -ATE, -ANE, or -ORE almost never dead-end.
Start Climbing
The difficulty of Word Ladder is invisible at the start. Two four-letter words look equally approachable until you begin and discover that one path flows through common hub words while another bottlenecks at an obscure intermediate. The step count is the score. Matching the optimal count is the achievement. Carroll's Vanity Fair readers understood this in 1879. They kept submitting solutions for years.
The other daily puzzles on this site, Lexle and Crossword, reset alongside Word Ladder each midnight, so you can build a three-puzzle daily routine. If you want to explore words without a step constraint, Anagram Forge gives you a set of letters and asks you to find everything hidden inside them. For a completely different kind of word challenge, Word Scramble tests how fast you can unscramble jumbled letters against a countdown timer.