Open a puzzle to compare candidates and follow the evidence. These sections contain answers; missing analyses are marked rather than inferred from answer letters.
Poople #17 — August 31, 2025
Round 1: THUG → POOP
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 8-step THUG ladder works
Start at THUG. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places THUG at distance 8. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
THUG → THUS: change letter 4 from G to S. The shortest remaining distance falls from 8 to 7.
THUS → THIS: change letter 3 from U to I. The shortest remaining distance falls from 7 to 6.
THIS → THIN: change letter 4 from S to N. The shortest remaining distance falls from 6 to 5.
THIN → CHIN: change letter 1 from T to C. The shortest remaining distance falls from 5 to 4.
CHIN → CHIP: change letter 4 from N to P. The shortest remaining distance falls from 4 to 3.
CHIP → CHOP: change letter 3 from I to O. The shortest remaining distance falls from 3 to 2.
CHOP → COOP: change letter 2 from H to O. The shortest remaining distance falls from 2 to 1.
COOP → POOP: change letter 1 from C to P. The shortest remaining distance falls from 1 to 0.
1 of the 3 accepted one-letter neighbours of THUG can start a shortest route: THUS. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
THUG → THUS
Keeps a shortest route
THUS is in the captured game dictionary and changes one letter. It needs at least 7 more steps, making 8 from THUG.
THUG → CHUG
Valid word, longer route
CHUG is in the captured game dictionary and changes one letter. It needs at least 8 more steps, making 9 from THUG, 1 more than the optimum.
THUG → THUD
Valid word, longer route
THUD is in the captured game dictionary and changes one letter. It needs at least 8 more steps, making 9 from THUG, 1 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 5-step YEAR ladder works
Start at YEAR. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places YEAR at distance 5. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
YEAR → BEAR: change letter 1 from Y to B. The shortest remaining distance falls from 5 to 4.
BEAR → BOAR: change letter 2 from E to O. The shortest remaining distance falls from 4 to 3.
BOAR → BOOR: change letter 3 from A to O. The shortest remaining distance falls from 3 to 2.
BOOR → POOR: change letter 1 from B to P. The shortest remaining distance falls from 2 to 1.
POOR → POOP: change letter 4 from R to P. The shortest remaining distance falls from 1 to 0.
1 of the 13 accepted one-letter neighbours of YEAR can start a shortest route: BEAR. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
YEAR → BEAR
Keeps a shortest route
BEAR is in the captured game dictionary and changes one letter. It needs at least 4 more steps, making 5 from YEAR.
YEAR → DEAR
Valid word, longer route
DEAR is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from YEAR, 1 more than the optimum.
YEAR → FEAR
Valid word, longer route
FEAR is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from YEAR, 1 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 6-step WINE ladder works
Start at WINE. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places WINE at distance 6. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
WINE → LINE: change letter 1 from W to L. The shortest remaining distance falls from 6 to 5.
LINE → LIME: change letter 3 from N to M. The shortest remaining distance falls from 5 to 4.
LIME → LIMP: change letter 4 from E to P. The shortest remaining distance falls from 4 to 3.
LIMP → PIMP: change letter 1 from L to P. The shortest remaining distance falls from 3 to 2.
PIMP → POMP: change letter 2 from I to O. The shortest remaining distance falls from 2 to 1.
POMP → POOP: change letter 3 from M to O. The shortest remaining distance falls from 1 to 0.
8 of the 23 accepted one-letter neighbours of WINE can start a shortest route: DINE, LINE, PINE, TINE, WILE, WIPE, WIRE, WISE. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
WINE → LINE
Keeps a shortest route
LINE is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from WINE.
WINE → DINE
Keeps a shortest route
DINE is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from WINE.
WINE → FINE
Valid word, longer route
FINE is in the captured game dictionary and changes one letter. It needs at least 6 more steps, making 7 from WINE, 1 more than the optimum.
WINE → KINE
Valid word, longer route
KINE is in the captured game dictionary and changes one letter. It needs at least 6 more steps, making 7 from WINE, 1 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 5-step HALF ladder works
Start at HALF. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places HALF at distance 5. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
HALF → HALL: change letter 4 from F to L. The shortest remaining distance falls from 5 to 4.
HALL → PALL: change letter 1 from H to P. The shortest remaining distance falls from 4 to 3.
PALL → POLL: change letter 2 from A to O. The shortest remaining distance falls from 3 to 2.
POLL → POOL: change letter 3 from L to O. The shortest remaining distance falls from 2 to 1.
POOL → POOP: change letter 4 from L to P. The shortest remaining distance falls from 1 to 0.
2 of the 5 accepted one-letter neighbours of HALF can start a shortest route: HALL, HALT. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
HALF → HALL
Keeps a shortest route
HALL is in the captured game dictionary and changes one letter. It needs at least 4 more steps, making 5 from HALF.
HALF → HALT
Keeps a shortest route
HALT is in the captured game dictionary and changes one letter. It needs at least 4 more steps, making 5 from HALF.
HALF → CALF
Valid word, longer route
CALF is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from HALF, 1 more than the optimum.
HALF → HALE
Valid word, longer route
HALE is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from HALF, 1 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 6-step WIND ladder works
Start at WIND. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places WIND at distance 6. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
WIND → FIND: change letter 1 from W to F. The shortest remaining distance falls from 6 to 5.
FIND → FOND: change letter 2 from I to O. The shortest remaining distance falls from 5 to 4.
FOND → FOOD: change letter 3 from N to O. The shortest remaining distance falls from 4 to 3.
FOOD → GOOD: change letter 1 from F to G. The shortest remaining distance falls from 3 to 2.
GOOD → GOOP: change letter 4 from D to P. The shortest remaining distance falls from 2 to 1.
GOOP → POOP: change letter 1 from G to P. The shortest remaining distance falls from 1 to 0.
3 of the 13 accepted one-letter neighbours of WIND can start a shortest route: BIND, FIND, WILD. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
WIND → FIND
Keeps a shortest route
FIND is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from WIND.
WIND → BIND
Keeps a shortest route
BIND is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from WIND.
WIND → KIND
Valid word, longer route
KIND is in the captured game dictionary and changes one letter. It needs at least 6 more steps, making 7 from WIND, 1 more than the optimum.
WIND → MIND
Valid word, longer route
MIND is in the captured game dictionary and changes one letter. It needs at least 6 more steps, making 7 from WIND, 1 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 5-step SAKE ladder works
Start at SAKE. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places SAKE at distance 5. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
SAKE → SAME: change letter 3 from K to M. The shortest remaining distance falls from 5 to 4.
SAME → SOME: change letter 2 from A to O. The shortest remaining distance falls from 4 to 3.
SOME → POME: change letter 1 from S to P. The shortest remaining distance falls from 3 to 2.
POME → POMP: change letter 4 from E to P. The shortest remaining distance falls from 2 to 1.
POMP → POOP: change letter 3 from M to O. The shortest remaining distance falls from 1 to 0.
1 of the 15 accepted one-letter neighbours of SAKE can start a shortest route: SAME. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
SAKE → SAME
Keeps a shortest route
SAME is in the captured game dictionary and changes one letter. It needs at least 4 more steps, making 5 from SAKE.
SAKE → BAKE
Valid word, longer route
BAKE is in the captured game dictionary and changes one letter. It needs at least 6 more steps, making 7 from SAKE, 2 more than the optimum.
SAKE → CAKE
Valid word, longer route
CAKE is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from SAKE, 1 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 7-step OPUS ladder works
Start at OPUS. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places OPUS at distance 7. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
OPUS → OPTS: change letter 3 from U to T. The shortest remaining distance falls from 7 to 6.
OPTS → OUTS: change letter 2 from P to U. The shortest remaining distance falls from 6 to 5.
OUTS → CUTS: change letter 1 from O to C. The shortest remaining distance falls from 5 to 4.
CUTS → COTS: change letter 2 from U to O. The shortest remaining distance falls from 4 to 3.
COTS → COOS: change letter 3 from T to O. The shortest remaining distance falls from 3 to 2.
COOS → COOP: change letter 4 from S to P. The shortest remaining distance falls from 2 to 1.
COOP → POOP: change letter 1 from C to P. The shortest remaining distance falls from 1 to 0.
1 of the 3 accepted one-letter neighbours of OPUS can start a shortest route: OPTS. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
OPUS → OPTS
Keeps a shortest route
OPTS is in the captured game dictionary and changes one letter. It needs at least 6 more steps, making 7 from OPUS.
OPUS → ONUS
Valid word, longer route
ONUS is in the captured game dictionary and changes one letter. It needs at least 8 more steps, making 9 from OPUS, 2 more than the optimum.
OPUS → OPES
Valid word, longer route
OPES is in the captured game dictionary and changes one letter. It needs at least 7 more steps, making 8 from OPUS, 1 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 5-step FARE ladder works
Start at FARE. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places FARE at distance 5. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
FARE → FORE: change letter 2 from A to O. The shortest remaining distance falls from 5 to 4.
FORE → PORE: change letter 1 from F to P. The shortest remaining distance falls from 4 to 3.
PORE → POME: change letter 3 from R to M. The shortest remaining distance falls from 3 to 2.
POME → POMP: change letter 4 from E to P. The shortest remaining distance falls from 2 to 1.
POMP → POOP: change letter 3 from M to O. The shortest remaining distance falls from 1 to 0.
2 of the 20 accepted one-letter neighbours of FARE can start a shortest route: PARE, FORE. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
FARE → FORE
Keeps a shortest route
FORE is in the captured game dictionary and changes one letter. It needs at least 4 more steps, making 5 from FARE.
FARE → PARE
Keeps a shortest route
PARE is in the captured game dictionary and changes one letter. It needs at least 4 more steps, making 5 from FARE.
FARE → BARE
Valid word, longer route
BARE is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from FARE, 1 more than the optimum.
FARE → CARE
Valid word, longer route
CARE is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from FARE, 1 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 6-step FARM ladder works
Start at FARM. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places FARM at distance 6. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
FARM → FORM: change letter 2 from A to O. The shortest remaining distance falls from 6 to 5.
FORM → FORD: change letter 4 from M to D. The shortest remaining distance falls from 5 to 4.
FORD → FOOD: change letter 3 from R to O. The shortest remaining distance falls from 4 to 3.
FOOD → GOOD: change letter 1 from F to G. The shortest remaining distance falls from 3 to 2.
GOOD → GOOP: change letter 4 from D to P. The shortest remaining distance falls from 2 to 1.
GOOP → POOP: change letter 1 from G to P. The shortest remaining distance falls from 1 to 0.
3 of the 6 accepted one-letter neighbours of FARM can start a shortest route: FORM, FARE, FART. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
FARM → FORM
Keeps a shortest route
FORM is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from FARM.
FARM → FARE
Keeps a shortest route
FARE is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from FARM.
FARM → HARM
Valid word, longer route
HARM is in the captured game dictionary and changes one letter. It needs at least 6 more steps, making 7 from FARM, 1 more than the optimum.
FARM → WARM
Valid word, longer route
WARM is in the captured game dictionary and changes one letter. It needs at least 6 more steps, making 7 from FARM, 1 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 5-step NEAT ladder works
Start at NEAT. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places NEAT at distance 5. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
NEAT → BEAT: change letter 1 from N to B. The shortest remaining distance falls from 5 to 4.
BEAT → BOAT: change letter 2 from E to O. The shortest remaining distance falls from 4 to 3.
BOAT → BOOT: change letter 3 from A to O. The shortest remaining distance falls from 3 to 2.
BOOT → BOOP: change letter 4 from T to P. The shortest remaining distance falls from 2 to 1.
BOOP → POOP: change letter 1 from B to P. The shortest remaining distance falls from 1 to 0.
2 of the 12 accepted one-letter neighbours of NEAT can start a shortest route: BEAT, PEAT. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
NEAT → BEAT
Keeps a shortest route
BEAT is in the captured game dictionary and changes one letter. It needs at least 4 more steps, making 5 from NEAT.
NEAT → PEAT
Keeps a shortest route
PEAT is in the captured game dictionary and changes one letter. It needs at least 4 more steps, making 5 from NEAT.
NEAT → FEAT
Valid word, longer route
FEAT is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from NEAT, 1 more than the optimum.
NEAT → HEAT
Valid word, longer route
HEAT is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from NEAT, 1 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 7-step AVID ladder works
Start at AVID. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places AVID at distance 7. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
AVID → ARID: change letter 2 from V to R. The shortest remaining distance falls from 7 to 6.
ARID → GRID: change letter 1 from A to G. The shortest remaining distance falls from 6 to 5.
GRID → GRIP: change letter 4 from D to P. The shortest remaining distance falls from 5 to 4.
GRIP → DRIP: change letter 1 from G to D. The shortest remaining distance falls from 4 to 3.
DRIP → DROP: change letter 3 from I to O. The shortest remaining distance falls from 3 to 2.
DROP → PROP: change letter 1 from D to P. The shortest remaining distance falls from 2 to 1.
PROP → POOP: change letter 2 from R to O. The shortest remaining distance falls from 1 to 0.
1 of the 3 accepted one-letter neighbours of AVID can start a shortest route: ARID. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
AVID → ARID
Keeps a shortest route
ARID is in the captured game dictionary and changes one letter. It needs at least 6 more steps, making 7 from AVID.
AVID → ACID
Valid word, longer route
ACID is in the captured game dictionary and changes one letter. It needs at least 7 more steps, making 8 from AVID, 1 more than the optimum.
AVID → AMID
Valid word, longer route
AMID is in the captured game dictionary and changes one letter. It needs at least 7 more steps, making 8 from AVID, 1 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 5-step NEAR ladder works
Start at NEAR. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places NEAR at distance 5. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
NEAR → BEAR: change letter 1 from N to B. The shortest remaining distance falls from 5 to 4.
BEAR → BOAR: change letter 2 from E to O. The shortest remaining distance falls from 4 to 3.
BOAR → BOOR: change letter 3 from A to O. The shortest remaining distance falls from 3 to 2.
BOOR → POOR: change letter 1 from B to P. The shortest remaining distance falls from 2 to 1.
POOR → POOP: change letter 4 from R to P. The shortest remaining distance falls from 1 to 0.
1 of the 13 accepted one-letter neighbours of NEAR can start a shortest route: BEAR. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
NEAR → BEAR
Keeps a shortest route
BEAR is in the captured game dictionary and changes one letter. It needs at least 4 more steps, making 5 from NEAR.
NEAR → DEAR
Valid word, longer route
DEAR is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from NEAR, 1 more than the optimum.
NEAR → FEAR
Valid word, longer route
FEAR is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from NEAR, 1 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 5-step HALE ladder works
Start at HALE. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places HALE at distance 5. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
HALE → HALL: change letter 4 from E to L. The shortest remaining distance falls from 5 to 4.
HALL → PALL: change letter 1 from H to P. The shortest remaining distance falls from 4 to 3.
PALL → POLL: change letter 2 from A to O. The shortest remaining distance falls from 3 to 2.
POLL → POOL: change letter 3 from L to O. The shortest remaining distance falls from 2 to 1.
POOL → POOP: change letter 4 from L to P. The shortest remaining distance falls from 1 to 0.
4 of the 19 accepted one-letter neighbours of HALE can start a shortest route: PALE, HOLE, HALL, HALT. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
HALE → HALL
Keeps a shortest route
HALL is in the captured game dictionary and changes one letter. It needs at least 4 more steps, making 5 from HALE.
HALE → PALE
Keeps a shortest route
PALE is in the captured game dictionary and changes one letter. It needs at least 4 more steps, making 5 from HALE.
HALE → BALE
Valid word, longer route
BALE is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from HALE, 1 more than the optimum.
HALE → DALE
Valid word, longer route
DALE is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from HALE, 1 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 6-step JIVE ladder works
Start at JIVE. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places JIVE at distance 6. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
JIVE → LIVE: change letter 1 from J to L. The shortest remaining distance falls from 6 to 5.
LIVE → LIME: change letter 3 from V to M. The shortest remaining distance falls from 5 to 4.
LIME → LIMP: change letter 4 from E to P. The shortest remaining distance falls from 4 to 3.
LIMP → PIMP: change letter 1 from L to P. The shortest remaining distance falls from 3 to 2.
PIMP → POMP: change letter 2 from I to O. The shortest remaining distance falls from 2 to 1.
POMP → POOP: change letter 3 from M to O. The shortest remaining distance falls from 1 to 0.
2 of the 7 accepted one-letter neighbours of JIVE can start a shortest route: DIVE, LIVE. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
JIVE → LIVE
Keeps a shortest route
LIVE is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from JIVE.
JIVE → DIVE
Keeps a shortest route
DIVE is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from JIVE.
JIVE → FIVE
Valid word, longer route
FIVE is in the captured game dictionary and changes one letter. It needs at least 6 more steps, making 7 from JIVE, 1 more than the optimum.
JIVE → GIVE
Valid word, longer route
GIVE is in the captured game dictionary and changes one letter. It needs at least 6 more steps, making 7 from JIVE, 1 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 6-step PICS ladder works
Start at PICS. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places PICS at distance 6. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
PICS → PICK: change letter 4 from S to K. The shortest remaining distance falls from 6 to 5.
PICK → LICK: change letter 1 from P to L. The shortest remaining distance falls from 5 to 4.
LICK → LOCK: change letter 2 from I to O. The shortest remaining distance falls from 4 to 3.
LOCK → LOOK: change letter 3 from C to O. The shortest remaining distance falls from 3 to 2.
LOOK → LOOP: change letter 4 from K to P. The shortest remaining distance falls from 2 to 1.
LOOP → POOP: change letter 1 from L to P. The shortest remaining distance falls from 1 to 0.
7 of the 11 accepted one-letter neighbours of PICS can start a shortest route: PECS, PIES, PIGS, PINS, PIPS, PITS, PICK. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
PICS → PICK
Keeps a shortest route
PICK is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from PICS.
PICS → PECS
Keeps a shortest route
PECS is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from PICS.
PICS → MICS
Valid word, longer route
MICS is in the captured game dictionary and changes one letter. It needs at least 6 more steps, making 7 from PICS, 1 more than the optimum.
PICS → SICS
Valid word, longer route
SICS is in the captured game dictionary and changes one letter. It needs at least 6 more steps, making 7 from PICS, 1 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 6-step OPTS ladder works
Start at OPTS. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places OPTS at distance 6. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
OPTS → OUTS: change letter 2 from P to U. The shortest remaining distance falls from 6 to 5.
OUTS → CUTS: change letter 1 from O to C. The shortest remaining distance falls from 5 to 4.
CUTS → COTS: change letter 2 from U to O. The shortest remaining distance falls from 4 to 3.
COTS → COOS: change letter 3 from T to O. The shortest remaining distance falls from 3 to 2.
COOS → COOP: change letter 4 from S to P. The shortest remaining distance falls from 2 to 1.
COOP → POOP: change letter 1 from C to P. The shortest remaining distance falls from 1 to 0.
2 of the 5 accepted one-letter neighbours of OPTS can start a shortest route: OATS, OUTS. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
OPTS → OUTS
Keeps a shortest route
OUTS is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from OPTS.
OPTS → OATS
Keeps a shortest route
OATS is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from OPTS.
OPTS → APTS
Valid word, longer route
APTS is in the captured game dictionary and changes one letter. It needs at least 7 more steps, making 8 from OPTS, 2 more than the optimum.
OPTS → OPES
Valid word, longer route
OPES is in the captured game dictionary and changes one letter. It needs at least 7 more steps, making 8 from OPTS, 2 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.
Reasoning & candidate comparison Contains the answer
Worked calculation
Why the 5-step DAWN ladder works
Start at DAWN. A breadth-first search from POOP over the 2,398 words in the captured official dictionary places DAWN at distance 5. Each edge changes exactly one letter, so no shorter route exists in this captured graph.
DAWN → DOWN: change letter 2 from A to O. The shortest remaining distance falls from 5 to 4.
DOWN → GOWN: change letter 1 from D to G. The shortest remaining distance falls from 4 to 3.
GOWN → GOON: change letter 3 from W to O. The shortest remaining distance falls from 3 to 2.
GOON → GOOP: change letter 4 from N to P. The shortest remaining distance falls from 2 to 1.
GOOP → POOP: change letter 1 from G to P. The shortest remaining distance falls from 1 to 0.
1 of the 8 accepted one-letter neighbours of DAWN can start a shortest route: DOWN. Compare remaining distance, not just how similar the spelling looks to POOP.
Candidate / approach
Assessment
Why
DAWN → DOWN
Keeps a shortest route
DOWN is in the captured game dictionary and changes one letter. It needs at least 4 more steps, making 5 from DAWN.
DAWN → FAWN
Valid word, longer route
FAWN is in the captured game dictionary and changes one letter. It needs at least 6 more steps, making 7 from DAWN, 2 more than the optimum.
DAWN → LAWN
Valid word, longer route
LAWN is in the captured game dictionary and changes one letter. It needs at least 5 more steps, making 6 from DAWN, 1 more than the optimum.
What this does and does not establish
This is our reproducible graph analysis using the dictionary snapshot captured 2026-11-20 (SHA-256 4e15f14a91768bd0b3c7104ed443dfd4499cbd0b4f7cdcbd1525fa83bfb6f5f9). It is not a claim that Poople published this exact route, or that its dictionary was identical on every historical date.