Poople answer archive

Poople #53 answer: NECK to POOP in 5 guesses (October 7, 2025)

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

  1. NECK
  2. NOCK
  3. LOCK
  4. LOOK
  5. LOOP
  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 #53 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 NECK

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

  1. NECK → BECK → BOCK → BOOK → BOOP → POOP
  2. NECK → HECK → HOCK → HOOK → HOOP → POOP
  3. NECK → NOCK → BOCK → BOOK → BOOP → POOP
  4. NECK → NOCK → COCK → COOK → COOP → POOP
  5. NECK → NOCK → HOCK → HOOK → HOOP → POOP
  6. NECK → NOCK → LOCK → LOOK → LOOP → POOP
  7. NECK → NOCK → NOOK → BOOK → BOOP → POOP
  8. NECK → NOCK → NOOK → COOK → COOP → POOP

2 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

NECK has 7 legal neighbours in the original word list (change one letter, still a word). 3 of the 7 legal first moves keep you on par: BECK, HECK, NOCK. Moves that cost exactly one extra guess: DECK, FECK, NICK, PECK.

How #53 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 #53 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.