All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Logic
Smart prisoners always get a break #2 (Posted on 2007-03-07) Difficulty: 4 of 5
Note: Read this problem carefully, because it's completely different from the original.

As before, 100 prisoners are put into solitary cells, and there's a room with a light bulb. (No prisoner can see the light bulb from his or her own cell.) Every night, the warden picks a prisoner at random, and that prisoner goes to the living room. While there, the prisoner can toggle the bulb if he or she wishes. but this time, the prisoner needs to assert that he knows, which prisoner was in the living room before him. If the assertion is false, all 100 prisoners will be shot. However, if it is indeed true, all prisoners are set free. Thus, the assertion should only be made if the prisoner is 100% certain of its validity.

The prisoners are allowed to get together one night, to discuss a plan.

But, the prisoners know that after that night, when they will go back to their solitary cells. the warden will choose one prisoner secretly (and this time, not randomly) and will kill him.

What plan should they agree on, so that eventually, someone will make a correct assertion?

  Submitted by Assaf    
Rating: 4.2500 (12 votes)
Solution: (Hide)
Let's call the prisoners P1, P2, P3...

The prisoners needs to agree that P1 will tern on the light only if he comes to the living room on the first day after the meet. P2 will tern on the light only if he comes to the living room on the second day. P3 will tern on the light only if he comes on the third day. And so on, and so on, up to P100. in this way, any prisoner who will come to the living room on the 31st day (for example) and will see that the light is on, will now that P30 is the one who tern it on. If non of the prisoners will come to the living room on there special day, then on the 101st day they shooed start a new round.

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Puzzle thoughtsK Sengupta2023-02-22 06:22:50
SolutionBetter than anything suggested before!Steve Herman2009-07-18 14:46:54
All mod n schemes work equally wellSteve Herman2009-07-18 12:37:12
re: How aboutRoberto Gonzalez2007-03-23 15:16:23
Just read solution(Spoiler)Brandon2007-03-19 17:52:02
How aboutBrandon2007-03-19 17:42:03
I agreeGeorge2007-03-07 12:27:13
Some Thoughtsre: Another wayCharlie2007-03-07 12:07:04
Some ThoughtsAnother wayCharlie2007-03-07 11:52:17
Some Thoughtsre(2): only 99% sureCharlie2007-03-07 11:38:57
Some Thoughtsre: only 99% sureCharlie2007-03-07 11:20:07
Some Thoughtsonly 99% sureCharlie2007-03-07 10:48:24
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information