top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

What Is the One Question That Will Ensure Madan’ Passage To Heaven?

0 votes
226 views

Madan is killed in a road accident and he finds himself in front of two identical doors.

One leads to heaven and one leads to hell.

There are identical gatekeepers at each door.

One gatekeeper can only tell the truth, whereas the other can only tell lies.

Only the gatekeepers themselves know who does or does not lie.

Madan can ask only one question to only one of the gatekeepers.

What Is the One Question That Will Ensure Madan’ Passage To Heaven?

posted Sep 5, 2017 by Brijesh Talwar

Share this puzzle
Facebook Share Button Twitter Share Button LinkedIn Share Button

1 Answer

0 votes

The question you need to ask is - "If I ask the other guard which is the door to heaven, which door will he point me to?"

Explanation:
No matter who you ask this question to, that guard will always point you to the door to hell.

1.If you ask this to the truth telling guard - he will honestly tell u that the lying guard will point you to the door to hell
2.If you ask the lying guard - he will lie to you and point you to the door to hell.
so, guard will always point you to the door to hell.so, you should choose the other door.

answer Sep 6, 2017 by Mogadala Ramana



Similar Puzzles
+1 vote
What strategy could they use to ensure they will go free?

There is a prison with 100 prisoners, each in separate cells with no form of contact. There is an area in the prison with a single light bulb in it. Each day, the warden picks one of the prisoners at random, even if they have been picked before, and takes them out to the lobby. The prisoner will have the choice to flip the switch if they want. The light bulb starts in the Switched off position.

When a prisoner is taken into the area with the light bulb, he can say "Every prisoner has been brought to the light bulb." If this is true all prisoners will go free. However, if a prisoner chooses to say this and it's wrong, all the prisoners will be executed. So a prisoner should only say this if he knows it is true for sure.

Before the first day of this process begins, all the prisoners are allowed to get together to discuss a strategy to eventually save themselves.

What strategy could they use to ensure they will go free?

0 votes
What method can they use to ensure they all go free?

A prison has 23 prisoners in 23 different cells. The prisoners have no way to communicate with each other in any way from their cells. There is another room, the rec room, that has two switches on the wall (A and B). The switches have on and off positions but they start in an unknown position.

Prisoners are randomly taken to and from the rec room one at a time. They must change the position of only one of the two switches each time they go to the room. At any point a prisoner can yell out, "Every prisoner has been here!" If the prisoner is correct that all of the prisoners have visited the rec room, then they all go free. If they aren't correct then they are all executed.

Before they start they are given one planning session during which they can discuss a method to win the game.
What method can they use to ensure they all go free?

+1 vote
What and where are the fewest number of cuts to the bar of gold that will allow you to pay him 1/7th each day?

A worker is to perform work for you for seven straight days. In return for his work, you will pay him 1/7th of a bar of gold per day. The worker requires a daily payment of 1/7th of the bar of gold.
What and where are the fewest number of cuts to the bar of gold that will allow you to pay him 1/7th each day?

0 votes
Suggest a strategy such that player A will always win, no matter how player B will play?

Suppose two player, player A and player B have the infinite number of coins. Now they are sitting near a perfectly round table and going to play a game. The game is, in each turn, a player will put one coin anywhere on the table (not on the top of coin already placed on the table, but on the surface of the table). And the player who places the last coin on the table will win the game. Given player A will always move first. Suggest a strategy such that player A will always win, no matter how player B will play?

0 votes
How will you distribute the jars among three people that each gets the equal number of jars and equal amount of water?

You have 21 jars with you. Out of them, 7 are filled with water, 7 are half-full with water and 7 are empty.
How will you distribute the jars among three people such that each one of them gets the equal number of jars and equal amount of water?

...