Word Ladder Solver
Enter a start word and an end word of the same length. The solver changes one letter at a time and lists every shortest ladder between them, so you can pick the route you like. Works with three, four, and five letter words.
- Three to five letters
- Breadth-first search
- Every shortest path

Worked word ladder examples
Each ladder below was produced by this solver and checked step by step. The label above each one says how many different ladders share that same shortest length.
3 letters, 3 moves, 2 shortest ladders
CAT → COT → COG → DOG
3 letters, 4 moves, 11 shortest ladders
DAY → DAD → DUD → DUN → SUN
4 letters, 4 moves, 3 shortest ladders
COLD → CORD → WORD → WORM → WARM
4 letters, 5 moves, 8 shortest ladders
HEAD → HEAR → HEIR → HAIR → HAIL → TAIL
5 letters, 5 moves, 4 shortest ladders
WITCH → WINCH → WENCH → TENCH → TEACH → PEACH
5 letters, 8 moves, 14 shortest ladders
BLACK → SLACK → STACK → STALK → STALE → SHALE → WHALE → WHILE → WHITE
Why this solver
Three, four, and five letters
Most word ladders in books and worksheets are three or five letters long, so the solver covers those as well as four. Each word list loads only when you choose that length.
All shortest paths shown
When several ladders share the same minimum length, the solver lists all of them, up to twenty, so you can choose the route you prefer instead of taking the first one found.
Breadth-first search, so the answer is provably shortest
The solver explores the word graph one layer at a time, which guarantees the ladder it returns is the shortest one that exists. There is no guessing and no heuristic.
Works with any Poople puzzle
Stuck on the daily Poople puzzle? Choose four letters, enter your current word as the start and POOP as the end, and the solver finds the shortest path from where you are.
About the solver
How does the solver work?
The solver uses a breadth-first search across the word graph for the length you chose. It explores all valid one-letter changes from the start word outward until it reaches the end word, which guarantees the path found is the shortest possible.
What word lengths can I use?
Three, four, and five letters. Both words have to be the same length, which is why the length selector sets the size of both boxes. Six letters and up are not offered, and the reason is measurable rather than a matter of taste. We built the six and seven letter lists from the same source and measured them the same way as the answer further down: in a six letter list of about 8,100 words, more than a quarter of the words have no one-letter neighbour at all, and only around 18 percent of random pairs have any ladder between them. At seven letters that falls to roughly 5 percent. Word ladders stop working as a puzzle somewhere between five and six letters, so shipping those lengths would mostly ship dead ends.
Where do the words come from?
Three and five letter ladders use SCOWL size 60, a widely used open word list that is large enough to cover everyday vocabulary while leaving out obscure entries that would make a solved ladder unreadable. You can read the full SCOWL licence on this site. We filter that list before use: words whose dominant meaning is a slur or is sexually explicit are removed, while ordinary vocabulary that a profanity filter tends to flag by mistake is kept. Four letter ladders use Poople’s own dictionary instead, for the reason in the next answer.
Why do four letter ladders use a different word list?
So that four letter results always match what the daily game accepts. Poople’s dictionary holds the four letter words that connect to POOP, which means a handful of ordinary words such as ABLE and ACRE are missing from it. That is a real limitation for general puzzles, and it is the trade for the solver never showing you a word the game would reject.
Does it find every shortest path?
Yes. The solver collects all paths that share the minimum length and lists each one. If the number of equal-length paths exceeds twenty, it shows the first twenty and notes how many were found in total.
What is a word ladder?
A word ladder is a puzzle where you transform one word into another by changing a single letter at each step, keeping a valid word at every rung. Lewis Carroll invented the concept in 1877 under the name Doublets. Poople is a daily word ladder where the target is always POOP.
Why does it say no ladder connects my two words?
Some words sit in their own corner of the graph with no one-letter neighbours at all, and some pairs sit in separate clusters that never meet. How often this happens depends heavily on length. Roughly 96 percent of random three letter pairs have a ladder, about 90 percent of four letter pairs, and about 58 percent of five letter pairs. So a failed five letter search is normal rather than a sign something is broken, and changing one of the two words usually finds a route. Those figures are our own: we split each of the word lists on this page into connected groups, then summed the square of each group’s share of the list, which gives the chance that two words picked at random land in the same group.
Why would I use a word ladder solver?
When you are stuck on a puzzle, the solver shows the shortest path from where you are so you can get moving again without guessing blindly. It also helps you learn the bridge words that turn up in many shortest paths.
How is this different from other word ladder solvers?
A solver that stops at the first shortest route it finds will hand you one ladder. This word ladder solver keeps going and collects every ladder that ties for the shortest length, then lists them all, so you can pick the wording you like rather than taking whatever came out first. It also covers three and five letter puzzles instead of a single length, and it names the word list behind each length rather than leaving you to guess why a word was rejected.
