The route reaches the final bridge COOP, then changes letter 1 to reach POOP. Its 8 moves match the dictionary distance calculated from the target.
Compare the first move
NANA has 4 accepted one-letter neighbors in this vocabulary. 3 can begin a shortest route: MANA, NADA, NANO. Each leaves exactly 7 moves to POOP.
Some longer openings are KANA (9 total moves). These counts include the first move from NANA.
Similarity can be misleading
NANA → NADA, NADA → DADA, DADA → DADS, DADS → CADS do not reduce the number of letters that differ from POOP, but still belong to a minimum-move route. Reachable word connections matter more than matching letters immediately.
If a word is rejected
Enter the last accepted word in the solver, exclude the rejected word, and recalculate. A shorter dictionary can require more moves. Read the strategy guide for a worked detour example.
