Poople answer archive
Poople #103 answer: OUCH to POOP in 7 guesses (November 26, 2025)
The Poople puzzle for November 26, 2025 starts from OUCH. The shortest ladder to POOP takes 7 guesses, and there are 19 different shortest routes. Here is one of them, using the most common words:
- OUCH
- SUCH
- SUCK
- LUCK
- LOCK
- LOOK
- LOOP
- POOP
Puzzle numbers follow the original game, which switches to a new word at 08:00 UTC.
Want to play instead of peeking?
Replay Poople #103 yourself in the archive: same starting word, same word list, with undo and hints. Or play today's Poople and the unlimited mode. Curious about a ladder of your own? The Poople solver finds the shortest path between any two four-letter words.
Every shortest ladder from OUCH
19 different ladders reach POOP in 7 guesses from OUCH. Here are 8 of them, the first using the most common words:
- OUCH → MUCH → MUCK → BUCK → BOCK → BOOK → BOOP → POOP
- OUCH → MUCH → MUCK → HUCK → HOCK → HOOK → HOOP → POOP
- OUCH → MUCH → MUCK → LUCK → LOCK → LOOK → LOOP → POOP
- OUCH → MUCH → MUCK → MOCK → BOCK → BOOK → BOOP → POOP
- OUCH → MUCH → MUCK → MOCK → COCK → COOK → COOP → POOP
- OUCH → MUCH → MUCK → MOCK → HOCK → HOOK → HOOP → POOP
- OUCH → MUCH → MUCK → MOCK → LOCK → LOOK → LOOP → POOP
- OUCH → MUCH → MUCK → MOCK → MOOK → BOOK → BOOP → POOP
11 more shortest ladders exist beyond these 8; the solver below can list routes from any word.
First moves: which keep par and which don't
OUCH has 2 legal neighbours in the original word list (change one letter, still a word). 2 of the 2 legal first moves keep you on par: MUCH, SUCH.
How #103 compares
Par 7 puts #103 among the longer puzzles: only 7% of all Pooples so far have needed more guesses. The fastest ladders go through an -OO- word one step from POOP (LOOP, HOOP, COOP, POOL, POOR, POOF); the shortest route above reaches one in 6 guesses.
Replay Poople #103 yourself
Same starting word, same word list as the original, with undo and hints. Replays don't touch your streak.
You got to POOP!
How the shortest path is found
Every four-letter word in the game's word list is a node; two words are linked when they differ by one letter. A breadth-first search from POOP gives the minimum number of steps for every word. When several shortest ladders exist, the one shown prefers common words, so it reads naturally — the same idea the original game uses for its "yesterday" solution.