Poople answer archive

Poople #111 answer: FAWN to POOP in 6 guesses (December 4, 2025)

The Poople puzzle for December 4, 2025 starts from FAWN. The shortest ladder to POOP takes 6 guesses, and there are 8 different shortest routes. Here is one of them, using the most common words:

  1. FAWN
  2. FAIN
  3. FAIL
  4. FOIL
  5. FOOL
  6. POOL
  7. 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 #111 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 FAWN

8 different ladders reach POOP in 6 guesses from FAWN. Here they all are, the first using the most common words:

  1. FAWN → DAWN → DOWN → GOWN → GOON → GOOP → POOP
  2. FAWN → LAWN → LAIN → LOIN → LOON → LOOP → POOP
  3. FAWN → SAWN → SOWN → GOWN → GOON → GOOP → POOP
  4. FAWN → SAWN → SOWN → SOON → BOON → BOOP → POOP
  5. FAWN → SAWN → SOWN → SOON → GOON → GOOP → POOP
  6. FAWN → SAWN → SOWN → SOON → LOON → LOOP → POOP
  7. FAWN → FAIN → LAIN → LOIN → LOON → LOOP → POOP
  8. FAWN → FAIN → FAIL → FOIL → FOOL → POOL → POOP

First moves: which keep par and which don't

FAWN has 6 legal neighbours in the original word list (change one letter, still a word). 4 of the 6 legal first moves keep you on par: DAWN, FAIN, LAWN, SAWN. Moves that cost exactly one extra guess: PAWN, YAWN.

How #111 compares

Par 6 puts #111 among the longer puzzles: only 13% 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 5 guesses.

Replay Poople #111 yourself

Same starting word, same word list as the original, with undo and hints. Replays don't touch your streak.

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.