Prisoner to be freed

The warden meets with 23 new prisoners when they arrive. He tells them, "You may meet today and plan a strategy. But after today, you will be in isolated cells and will have no communication with one another.

"In the prison is a switch room, which contains two light switches labeled 1 and 2, each of which can be in either up or the down position. I am not telling you their present positions. The switches are not connected to anything.

"After today, from time to time whenever I feel so inclined, I will select one prisoner at random and escort him to the switch room. This prisoner will select one of the two switches and reverse its position. He must flip one switch when he visits the switch room, and may only flip one of the switches. Then he'll be led back to his cell.

"No one else will be allowed to alter the switches until I lead the next prisoner into the switch room. I'm going to choose prisoners at random. I may choose the same guy three times in a row, or I may jump around and come back. I will not touch the switches, if I wanted you dead you would already be dead.

"Given enough time, everyone will eventually visit the switch room the same number of times as everyone else. At any time, anyone may declare to me, 'We have all visited the switch room.'

"If it is true, then you will all be set free. If it is false, and somebody has not yet visited the switch room, you will all die horribly. You will be carefully monitored, and any attempt to break any of these rules will result in instant death to all of you"

What is the strategy they come up with so that they can be free?




Similar Riddles

In a picnic session, a footballer was practicing. During his play, he busted lips and ears and broke ribs and thighs. However, he was still able to play a professional match on the very next day.



How can this be possible?

Asked by Neha on 20 Jan 2021


Railroad Crossing, look out for the cars. Can you spell that, without any R's ?

Asked by Neha on 14 May 2021

In a science lab, a petri dish hosts a healthy colony of yeast for an experiment. Now every minute, all the yeast cells divide into two. At noon, there was just a single cell of yeast and at 1:22, the Petri dish was half full. Can you calculate when the dish will be full of yeast?

Asked by Neha on 23 Jun 2021


Which Travels Faster? Solve below famous picture riddle:

Which Travels Faster

Asked by Neha on 11 Dec 2024

When it is alive we sing, when it is dead we clap our hands. What is it?

Asked by Neha on 22 Aug 2025

In a family supper, a grandfather, a grandmother, two fathers, two mothers, four children, three grandchildren, one brother, two sisters, two sons, two daughters, one daughter-in-law, and one mother-in-law need to sit at a table.

There are only seven chairs available at the place. How many more chairs do they have to borrow so that everyone can sit down together for the suppers if everybody requires a separate chair?

Asked by Neha on 09 Nov 2024


I never was there, I am always to be.
You have never ever seen me, not ever you will.
Yet I am the confidence of everyone.

Who Am I?

Asked by Neha on 01 Feb 2024

Can you solve below mathematical equation?

2^1234 - 2^1233

Asked by Neha on 26 Jan 2024

A man was gazing through the window of the 23rd floor of the building. He suddenly opened the window and jumped on the other side of the window. On landing on the floor, there was not a sheer mark of injury on him.

How can that be possible if he did not use any kind of parachute and did not land on a soft surface?

Asked by Neha on 12 Feb 2025


At a party, there are five people and a whole round cake lying at the centre of the table. Only four people will make a cut and take their piece and the last one will get the remaining piece on the table. How can they make sure that everyone gets a 1/5th of the piece?

Asked by Neha on 20 Sep 2024

Hot Articles

Amazing Facts

No Solution

In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki