Word Ladder Generator
A word ladder turns one word into another by changing a single letter at a time, and every step in between has to be a real word. That last part is what makes them hard to write by hand and easy to get wrong: a ladder whose answer runs through something that is not a word is not a puzzle, it is a trap.
What this generator does
Produces a start word, a target word and a guaranteed route between them. Every rung is drawn from a published word list rather than checked against a spell-checker afterwards, so a ladder through a non-word cannot be generated. The answer shown is the shortest path that exists in that list, which is what makes the stated difficulty mean something.
How to use this tool
- Choose a word length and how many steps you want.
- Press Make a ladder.
- Change one letter at a time to get from the first word to the last, making a real word at every step.
- Reveal the answer to see the shortest path the word list allows.
Understanding the controls
- Word length
- Three letters gives a dense web where almost everything connects, so ladders are short and easy. Four letters is the classic size and the one with the most interesting puzzles.
- Steps
- How many changes the shortest route takes. Three is a warm-up; six is genuinely hard, because several rungs will have almost no alternatives.
- Seed
- Reproduces the identical ladder, so a class can all work the same one or a lost sheet can be reprinted.
Worked examples
- The classic
- COLD to WARM: cold, cord, card, ward, warm.
- A gentle one
- Three letters, three steps, with a dozen options at each.
- A hard one
- Six steps where two of the rungs have only two alternatives each.
- Reprintable
- The seed 'monday-starter' always gives the same ladder.
Common use cases
- Spelling and vocabulary practice that rewards experimenting
- A printable literacy starter with an objective answer
- Puzzle pages where the answer can be checked rather than argued about
- Showing that a search problem can have a provably shortest solution
How this generator works
The word list is treated as a graph: every word is joined to every other word that differs from it in exactly one position. A breadth-first search from the start word then finds the shortest route to the target, and breadth-first is what makes it the shortest rather than merely a route — a depth-first walk would return some path and the difficulty grade would mean nothing. Pairs whose shortest route falls outside the step range you asked for are discarded and another pair is drawn. The grade combines the step count with how many alternatives each rung has, because a long path through crowded words is much easier than a short one through isolated ones.
Randomness and fairness
The start and target words are drawn with the browser's cryptographic random number generator; everything after that is a deterministic search, so the answer is not chosen but found. A seed switches to a reproducible generator so the same ladder can be printed twice; that mode is deterministic, not cryptographic.
For how randomness is produced across the whole site, see how Generate Random works.
Assumptions this tool makes
- A step changes exactly one letter and keeps every other letter in place.
- Every rung must be a word in the published list, including the two ends.
Limitations and good to know
- The word list is curated rather than a full dictionary, so some perfectly good English words are missing. You may find a valid route the tool does not know about — that is a gap in the list, not a wrong answer.
- Because the list is limited, the shortest path shown is the shortest within that list. A larger dictionary might permit a shorter one.
- Only single-letter substitution is used. Ladders that add or remove letters are a different puzzle and are not generated here.
- No proper nouns, abbreviations or inflected-only forms are included, which removes a lot of the words that make hand-made ladders arguable.
- There is no solving surface — this generates the puzzle and the answer for you to work on paper or in your head.
Common mistakes
- Changing the position of letters as well as the letter
- Each step changes one letter and leaves the others exactly where they are. Rearranging is an anagram, which is a different puzzle.
- Assuming your route is wrong because it is different
- Many ladders have several shortest routes of the same length. If yours is the same number of steps and every rung is a word, it is just as correct.
- Getting stuck and adding a plural
- Inflected forms are deliberately not in the list, precisely because 'add an s' turns most ladders into a trivial exercise.
Practical tips
- Work from both ends at once. Meeting in the middle is much faster than walking forward, and it is how the solver does it.
- Look at which letter positions the two words already share. Those are usually the ones to leave alone.
- For a class, use a seed and print once. Comparing different routes of the same length is the most interesting part of the exercise.
Troubleshooting
- My route is shorter than the answer
- Check that every rung is a single-letter change and a real word. If it holds up, you have found a word the curated list does not contain, which is worth knowing and is a limitation of the list.
- No ladder came back
- Long step ranges at three letters often have no pair that far apart, because short words connect too densely. Widen the range or switch to four letters.
Privacy and your data
Nothing is entered and nothing is stored. Ladders are generated in your browser, never uploaded and never written into the page address. Analytics records only that the tool ran and at what length.
Frequently asked questions
- How do you know every step is a real word?
- Because the puzzle is built by searching a published word list rather than by generating a route and checking it afterwards. A rung that is not in the list cannot appear, and the list is small enough to have been reviewed by a person — which is a stronger claim than a large dictionary of uncertain provenance would support.
- Is the answer the only one?
- No, and the page does not claim it is. It is the shortest route the word list allows, and several different routes of that same length often exist. Any route of the same length whose rungs are all words is equally correct.
- Who invented word ladders?
- Lewis Carroll, who called them doublets, in 1877. The rules have not changed since: one letter at a time, and every step must be a word.
Related generators
- Word Scramble GeneratorScramble your own spelling or vocabulary list into an unjumbling worksheet, with an answer key one tap away.
- Anagram CheckerCheck whether two words or phrases are anagrams, and see the sorted letters that prove it either way.
- Nonogram GeneratorPrintable nonograms whose clues are proved to have exactly one solution, and to be solvable without guessing.