*Originally posted by TinoLaan*

Haven't seen the movie but I know the answer already (general math problem)

It's a really interesting problem to solve though

this, but as a math wizard I dont find Monty Hall problem as a interesting to solve tho.

It's wayyy more interesting this:

**The riddle:** 100 prisoners are in solitary cells, unable to see, speak or communicate in any way from those solitary cells with each other. There's a central living room with one light bulb; the bulb is initially off. No prisoner can see the light bulb from his own cell. Everyday, the warden picks a prisoner at random, and that prisoner goes to the central living room. While there, the prisoner can toggle the bulb if he or she wishes. Also, the prisoner has the option of asserting the claim that all 100 prisoners have been to the living room. If this assertion is false (that is, some prisoners still haven't been to the living room), all 100 prisoners will be shot for their stupidity. 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.

Before the random picking begins, the prisoners are allowed to get together to discuss a plan. So ---- what plan should they agree on, so that eventually, someone will make a correct assertion?

**Q:** *How can the prisoners tell, with certainty, that all 100 of them have visited the central living room with the light bulb.*