Why the shortest path is reliable
Breadth-first search explores all routes with one move, then two moves, then three. The first time it reaches the start word, that distance is the mathematical minimum for the current word list.
There may be several equally short routes. Any route that reaches POOP in the minimum number of accepted moves is a perfect solve.