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

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?

Asked by Neha on 23 Apr 2022


It comprises roots which nobody sees,
Much taller than those trees,
Up and up it goes,
Still it never grows?

Asked by Neha on 02 Jan 2025

Why are televisions attracted to people?

Asked by Neha on 14 Jan 2024


When Jack was six years old he hammered a nail into his favourite tree to mark his height. Ten years later at age sixteen, Jack returned to see how much higher the nail was. If the tree grew by five centimetres each year, how much higher would the nail be?

Asked by Neha on 17 May 2021

You are trapped into a death trap by the famous jigsaw killer. As usual, a screen flashes in front of you and explains you the trap game. There are 100 pearls kept in a bowl in front of you and an empty bowl. Among the 100 pearls, 50 are white and 50 are black. You can divide them as you like into the two bowls. Once you are done, you will pull a lever, which will turn the room pitch black. The bowls will move and shuffle around. In the dark, you have to pick up one pearl from any bowl. Once you do that, the room will flood with lights again. If the peral you have in your hand is white, you will be allowed to live, but if the pearl you picked is black, the room will be filled with poisonous gas and you will die. How will divide the pearls to increase your chances of survival?

Asked by Neha on 03 Sep 2024

How can you throw a ball as hard as you can and have it come back to you even if it doesn't hit anything there is nothing attached to it and no one else catches or throws it.

Asked by Neha on 06 Nov 2025


What will be the best approach to finding all the prime numbers less than 75 that leave an odd reminder when we divide them with 5?

Asked by Neha on 12 Jul 2021

If,

Akriti = 631
Levis = 521
Sroti = 521
Aneel = 533
Then,
Sunil =?

Asked by Neha on 25 Jan 2026

You are in a room with no metal objects except for two iron rods. Only one of them is a magnet.
How can you identify which one is a magnet?

Asked by Neha on 28 Feb 2024


Solve the rebus riddle in the picture below.

Millionaire Riddle

Asked by Neha on 14 Feb 2026

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