ANEW to POOP.
A reusable word-ladder guide, rather than a dated daily puzzle. Every move below changes exactly one letter.
A shortest path from ANEW.
ANEW reaches POOP in 7 moves. The list includes 8 words because the starting position costs no move.
- StartANEWThe starting word; no move used
- Move 1KNEWReplace A with K in position 1
- Move 2KNOWReplace E with O in position 3
- Move 3SNOWReplace K with S in position 1
- Move 4SLOWReplace N with L in position 2
- Move 5PLOWReplace S with P in position 1
- Move 6PLOPReplace W with P in position 4
- Move 7POOPReplace L with O in position 2
Compare 2 shortest routes
- ANEW · KNEW · KNOW · SNOW · SLOW · PLOW · PLOP · POOP
- ANEW · KNEW · KNOW · SNOW · SLOW · SLOP · PLOP · POOP
This list contains every shortest route in the checked word list.
Which first moves work?
One next word keeps you on a shortest route from ANEW: KNEW.
The table lists all 1 accepted one-letter neighbors. “Moves remaining” starts after that first move. “Total via this word” includes it, so you can compare that choice with the 7-move minimum.
| Next word | Moves remaining | Total via this word | Result |
|---|---|---|---|
| KNEW | 6 | 7 | Shortest route |
Why 7 moves is the minimum.
ANEW differs from POOP in 4 letter positions, so any route needs at least 4 changes. The accepted intermediate words require a longer route: the first complete connection in our search occurs at 7 moves.
The solver searches the checked word graph in distance order. It reaches every word one move away before trying two moves, then continues until it reaches POOP. The minimum applies to this word list; another game or dictionary may accept different connections.
Our Tricky label uses distance only: up to 5 moves is Easy, 6 is Moderate, 7 is Tricky, 8 is Hard, and 9 or more is Expert. It does not measure how familiar you will find each word.
Try ANEW with a different target or read the verification method.
More 7-move ladders.
These starting words have the same shortest distance to POOP in the checked list.