Poople answer archive

Poople #270 answer: DUNG to POOP in 6 guesses (May 12, 2026)

The Poople puzzle for May 12, 2026 starts from DUNG. The shortest ladder to POOP takes 6 guesses, and there are 9 different shortest routes. Here is one of them, using the most common words:

  1. DUNG
  2. DONG
  3. BONG
  4. BONK
  5. BOOK
  6. BOOP
  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 #270 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 DUNG

9 different ladders reach POOP in 6 guesses from DUNG. Here are 8 of them, the first using the most common words:

  1. DUNG → BUNG → BONG → BONK → BOOK → BOOP → POOP
  2. DUNG → BUNG → BUNK → BONK → BOOK → BOOP → POOP
  3. DUNG → HUNG → HUNK → HONK → HOOK → HOOP → POOP
  4. DUNG → DONG → BONG → BONK → BOOK → BOOP → POOP
  5. DUNG → DONG → DONE → DOME → POME → POMP → POOP
  6. DUNG → DONG → DONS → CONS → COOS → COOP → POOP
  7. DUNG → DUNE → DONE → DOME → POME → POMP → POOP
  8. DUNG → DUNK → BUNK → BONK → BOOK → BOOP → POOP

1 more shortest ladder exist beyond these 8; the solver below can list routes from any word.

First moves: which keep par and which don't

DUNG has 10 legal neighbours in the original word list (change one letter, still a word). 5 of the 10 legal first moves keep you on par: BUNG, DONG, DUNE, DUNK, HUNG. Moves that cost exactly one extra guess: DANG, DING, LUNG, RUNG, SUNG.

How #270 compares

Par 6 puts #270 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 #270 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.