Turn a four-letter starting word into POOP, one changed letter at a time, in Poople’s daily word-ladder puzzle. Every intermediate entry must be accepted by the game, and the aim is to reach that fixed destination in as few moves as possible. Our completed ladder took seven moves; the result panel reported that five would have been enough.
One changed letter, two different rejection messages
The opening board supplies a word and an empty four-square row. We used the on-screen letter keys to enter each new word, then pressed Enter. An accepted entry becomes another rung in the ladder, so the next move must connect to that word rather than to the original starting word.
The tutorial’s BARN → BORN example explains the positional rule neatly: replace A with O and leave the other three letters alone. You are building a sequence of words, not guessing an unknown destination or rearranging an anagram.
We tried POOP straight from the starting word, CYAN. The game rejected it with “Not one letter different.” Knowing the destination does not let you skip the connecting words. We then tested CYAX: it changed only one position but produced “Not in word list.” Neither rejected submission added a rung. The messages call for different checks: count the changed positions for the first error; reconsider the proposed word for the second.
The interface did not explain its dictionary’s full scope during our round. An invented word being refused establishes a vocabulary check; it does not establish which regional spellings, inflections or obscure words will work.
Why the destination is always POOP
Developer Elias Furst’s account of the game’s origins traces it to a word game his father devised for family road trips. The target was chosen partly for the joke and partly for its consonant–vowel–vowel–consonant structure. That explains the fixed destination: the daily change comes from the starting word.
A valid move is not necessarily a shorter route
We completed daily puzzle #439 on October 28, 2026, in seven accepted moves against the game’s reported best of five. A search preview had inadvertently revealed part of a solution, so this run does not establish unaided difficulty.
The two rejected inputs were not included in that seven-move total. Invalid submissions and accepted detours therefore raise different problems: fixing a rejected entry gets the ladder moving again, while choosing a legal word still leaves the question of where it leads. Our finish demonstrated that reaching POOP does not establish that the route was efficient.
Brown tiles marked letters matching POOP in the same position, with all four brown at the finish. They show which positions match the target, but do not supply the connecting words or prove that a route is shortest.
A useful planning question is “What accepted word could come next?” rather than only “Does this look closer to POOP?” That follows from the need to connect every rung; our round did not test a method for guaranteeing the fewest moves.
