this post was submitted on 31 Jan 2025
238 points (98.4% liked)

Not The Onion

13002 readers
1120 users here now

Welcome

We're not The Onion! Not affiliated with them in any way! Not operated by them in any way! All the news here is real!

The Rules

Posts must be:

  1. Links to news stories from...
  2. ...credible sources, with...
  3. ...their original headlines, that...
  4. ...would make people who see the headline think, “That has got to be a story from The Onion, America’s Finest News Source.”

Comments must abide by the server rules for Lemmy.world and generally abstain from trollish, bigoted, or otherwise disruptive behavior that makes this community less fun for everyone.

And that’s basically it!

founded 2 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 2 points 2 hours ago (1 children)

solutionNumber all bottles in binary, starting from 0000000000. Then the Nth prisoner drinks all wines where the Nth digit is "1". have each prisoner drinking the wines where a certain digit is "1".

So for example. If you had 8 bottles and 3 prisoners (exact same logic):

  • number your wines 000, 001, 010, 011, 100, 101, 110, 111
  • Prisoner 1 drinks wines 100, 101, 110, 111; if he dies the leftmost digit of the poisoned wine is 1, if he lives the poisoned wine starts with 0
  • Prisoner 2 drinks wines 010, 011, 110, 111; if he dies the mid digit is 1, else it's 0
  • Prisoner 3 drinks wines 001, 011, 101, 111; if he dies the right digit is 1, else it's 0

If nobody dies the poisoned wine is numbered 000. And if all die it's the 111.

[–] [email protected] 1 points 1 hour ago

Did ya need the hint?