Poople answer archive

Poople #379 answer: MICA to POOP in 7 guesses (August 29, 2026)

The Poople puzzle for August 29, 2026 starts from MICA. The shortest ladder to POOP takes 7 guesses, and there are 18 different shortest routes. Here is one of them, using the most common words:

Puzzle numbers follow the original game, which switches to a new word at 08:00 UTC.

Want to play instead of peeking?

Replay Poople #379 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 MICA

18 different ladders reach POOP in 7 guesses from MICA. Here are 8 of them, the first using the most common words:

1. MICA → MICE → DICE → DIME → DOME → POME → POMP → POOP
2. MICA → MICE → LICE → LIME → LIMP → PIMP → POMP → POOP
3. MICA → MICE → LICE → LICK → LOCK → LOOK → LOOP → POOP
4. MICA → MICE → MIKE → PIKE → POKE → POME → POMP → POOP
5. MICA → MICE → MILE → PILE → POLE → POME → POMP → POOP
6. MICA → MICE → MILE → PILE → POLE → POLL → POOL → POOP
7. MICA → MICE → MILE → PILE → PILL → POLL → POOL → POOP
8. MICA → MICE → MILE → MOLE → POLE → POME → POMP → POOP

10 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

MICA 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: MICE, MICS.

How #379 compares

Par 7 puts #379 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 #379 yourself

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

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.