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

 Smart prisoners always get a break #2 (Posted on 2007-03-07)
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?

 See The Solution Submitted by Assaf Rating: 4.2500 (12 votes)

 Subject Author Date Better than anything suggested before! Steve Herman 2009-07-18 14:46:54 All mod n schemes work equally well Steve Herman 2009-07-18 12:37:12 re: How about Roberto Gonzalez 2007-03-23 15:16:23 Just read solution(Spoiler) Brandon 2007-03-19 17:52:02 How about Brandon 2007-03-19 17:42:03 I agree George 2007-03-07 12:27:13 re: Another way Charlie 2007-03-07 12:07:04 Another way Charlie 2007-03-07 11:52:17 re(2): only 99% sure Charlie 2007-03-07 11:38:57 re: only 99% sure Charlie 2007-03-07 11:20:07 only 99% sure Charlie 2007-03-07 10:48:24

 Search: Search body:
Forums (0)