COMP to POOP.
A reusable word-ladder guide, rather than a dated daily puzzle. Every move below changes exactly one letter.
A shortest path from COMP.
COMP reaches POOP in 2 moves. The list includes 3 words because the starting position costs no move.
- StartCOMPThe starting word; no move used
- Move 1COOPReplace M with O in position 3
- Move 2POOPReplace C with P in position 1
Compare 2 shortest routes
- COMP · COOP · POOP
- COMP · POMP · POOP
This list contains every shortest route in the checked word list.
Which first moves work?
2 next words keep you on a shortest route from COMP: COOP, POMP.
The table lists all 8 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 2-move minimum.
Why 2 moves is the minimum.
COMP differs from POOP in 2 letter positions, so any route needs at least 2 changes. This route meets that lower bound.
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 Easy 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 COMP with a different target or read the verification method.
More 2-move ladders.
These starting words have the same shortest distance to POOP in the checked list.