The route reaches the final bridge POMP, then changes letter 3 to reach POOP. Its 7 moves match the dictionary distance calculated from the target.
Compare the first move
JAVA has 3 accepted one-letter neighbors in this vocabulary. 1 can begin a shortest route: LAVA. Each leaves exactly 6 moves to POOP.
Some longer openings are FAVA (8 total moves), KAVA (8 total moves). These counts include the first move from JAVA.
Similarity can be misleading
JAVA → LAVA, LAVA → LAMA, LAMA → LUMA 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.
