Poople answer archive

Poople #37 answer: TOES to POOP in 5 guesses (September 21, 2025)

The Poople puzzle for September 21, 2025 starts from TOES. The shortest ladder to POOP takes 5 guesses, and there are 17 different shortest routes. Here is one of them, using the most common words:

  1. TOES
  2. DOES
  3. DOER
  4. DOOR
  5. POOR
  6. 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 #37 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 TOES

17 different ladders reach POOP in 5 guesses from TOES. Here are 8 of them, the first using the most common words:

  1. TOES → DOES → DOER → DOOR → POOR → POOP
  2. TOES → HOES → HOED → HOOD → HOOP → POOP
  3. TOES → WOES → WOOS → BOOS → BOOP → POOP
  4. TOES → WOES → WOOS → COOS → COOP → POOP
  5. TOES → WOES → WOOS → WOOF → POOF → POOP
  6. TOES → WOES → WOOS → WOOL → POOL → POOP
  7. TOES → TOMS → TOME → POME → POMP → POOP
  8. TOES → TONS → CONS → COOS → COOP → POOP

9 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

TOES has 17 legal neighbours in the original word list (change one letter, still a word). 11 of the 17 legal first moves keep you on par: DOES, HOES, TOED, TOMS, TONS, TOPS, TOSS, TOTS, TOWS, TOYS, WOES. Moves that cost exactly one extra guess: FOES, GOES, NOES, ROES, TEES. Moves that cost two or more: TIES.

How #37 compares

Par 5 is the most common Poople length: about 54% of all puzzles so far have par 5. 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 4 guesses.

Replay Poople #37 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.