Poople Answer: October 21, 2026

VEAL → PEAL → PEAT → PLAT → PLOT → PLOP → POOP

7 words. 6 changes. A shortest route in the checked official word list; equally short alternatives may exist.

1. VEAL → PEAL — position 1, V to P. A PEAL can mean the ringing sound of bells.
2. PEAL → PEAT — position 4, L to T. PEAT is partially decayed plant material. Only the final letter changes.
3. PEAT → PLAT — position 2, E to L. PLAT can mean a map of a tract of land. Only the second letter changes.
4. PLAT → PLOT — position 3, A to O. PLOT is reached by changing the third letter from A to O.
5. PLOT → PLOP — position 4, T to P. PLOP is reached by changing the final letter from T to P.
6. PLOP → POOP — position 2, L to O. Change the second letter from L to O to reach the target.

Why this route works

This checked Poople answer is for puzzle #433, which began at 08:00 UTC on October 21, 2026. Confirm that the official game starts with VEAL before using the route. There are seven words and six letter changes; VEAL is the starting position, not move one. First, change V to P to make PEAL. Next, change the last letter from L to T for PEAT. Change the second letter from E to L for PLAT. Change the third letter from A to O to form PLOT. Replace the final T with P for PLOP. Finally, change the second letter from L to O to reach POOP. Every word in this chain belongs to the accepted-word set in the official runtime checked for this record. The official distance table and an independent breadth-first search both give a six-move minimum from VEAL. This is one shortest route within that source snapshot; we have not claimed it is unique or replayed the route through the official game interface. Notice that PEAL, PEAT and PLAT each have only their first letter in the correct target position. Those moves still reduce the proven remaining distance. Matching more target letters on every move is not a rule of this puzzle. Our separate solver uses the independently licensed ENABLE word list, so its output must not be treated as an interchangeable official-game answer.

Why four different letters still require six moves

VEAL differs from POOP in all four positions. That gives a lower bound of four changes: every position must eventually be replaced. It does not show that a four-move chain of accepted words exists. The official word graph checked for this puzzle puts VEAL six transitions from the target, and our independent breadth-first search reaches the same result. The extra moves reflect the available word connections, not a different way of counting the starting word.

In this particular route, the second position changes twice, from E to L and later to O. The fourth position also changes twice, from L to T and later to P. The first and third positions change once each. Adding those replacements gives six moves. Tracking positions makes the count easy to check without guessing whether two similar-looking words can be entered directly.

Progress does not always add another matching letter

After the first move, PEAL has its initial P in the target position. PEAT and PLAT retain that same single positional match. Nevertheless, the checked distances are five, four and three moves remaining respectively. The route is making progress through the accepted-word graph even while the visible count of matching target letters stays unchanged. Requiring every move to add a new matching letter would rule out these useful connections.

PLOT then matches the first and third positions of POOP. PLOP adds the final P, leaving only the second letter to change. Read the words by their positions: PLOT to POOP is not a single move because both the second and fourth letters differ. PLOP is the intermediate connection used in this answer. If you are on another branch, check your actual current word before copying any step.

What this six-move proof does and does not establish

Each displayed suffix is a shortest route in the checked source: PEAL has five moves remaining, PEAT four, PLAT three, PLOT two and PLOP one. A shorter suffix would also produce a shorter complete path from VEAL, contradicting the six-move minimum found by breadth-first search. This explains the distance table without claiming that the displayed intermediate words are forced.

The evidence applies to the official runtime snapshot and this dated puzzle. It does not establish an acceptance guarantee after a future dictionary change, and it does not turn a result from the separate ENABLE-based solver into an official route. If a displayed step is rejected, preserve the preceding word and the exact rejected pair so the source and the move can be checked separately.

Remaining moves on this checked route

Each suffix of a shortest route must also be shortest: a shorter suffix would give a shorter complete route. These values describe remaining changes, not the moves already used on your board.