# Puzzle | Thief, Treasure and 2 Doors

**Puzzle:**

**A thief** has just found a **pair of ancient treasure caves**.

- One of the caves is filled with unbelievable treasure and the other has a fire breathing monster that will eat anyone

who opens that cave. - One cave has a black door decorated with diamonds and the other cave has a brown door decorated with sapphires.
- Each of the doors has an engraved description on top. The descriptions say:
**Black Door:**Monster is here.

**Brown Door:**Only One Door speaks the truth.

### Which door should the thief open?

**Solution:**

Let us look at the description on the **Brown door**. It can be correct or wrong.

**Scenario 1:**The description on the**Brown door**is**true**. Then the description on the**Black door**has to be true. That means that the inscription on the**Black door is false**and the cave with**black door**contains the treasure!**Scenario 2:**The description on the**Brown door**is false. Then either both the descriptions are false or both are true. Both cannot be true as that is impossible and not consistent. That means that both descriptions are false. Again,**the treasure is in the Black door.**

## Recommended Posts:

- Puzzle 1 | (How to Measure 45 minutes using two identical wires?)
- Puzzle 2 | (Find ages of daughters)
- Puzzle 3 | (Calculate total distance travelled by bee)
- Puzzle 4 | (Pay an employee using a 7 units gold rod?)
- Puzzle 13 | (100 Prisoners with Red/Black Hats)
- Puzzle 5 | (Finding the Injection for Anesthesia)
- Puzzle 6 | (Monty Hall problem)
- Puzzle 7 | (3 Bulbs and 3 Switches)
- Puzzle 8 | (Find the Jar with contaminated pills)
- Puzzle 9 | (Find the fastest 3 horses)
- Puzzle 10 | (A Man with Medical Condition and 2 Pills)
- Puzzle 11 | (1000 Coins and 10 Bags)
- Puzzle 12 | (Maximize probability of White Ball)
- Puzzle 14 | (Strategy for a 2 Player Coin Game)
- Puzzle 15 | (Camel and Banana Puzzle)

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.