All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Logic
Chests (Posted on 2024-03-20) Difficulty: 3 of 5
You are in a room with 2N Plaminians and C locked chests. One of the chests contains a treasure. Half of the Plaminians are consecrated, and know which chest contains the treasure. The other Plaminians do not know which chest has the treasure. All of the Plaminians know which ones are consecrated. You do not know which Plaminians are consecrated, or which chest has the treasure.

The Plaminians have agreed that you may ask each one a yes/no question, and they will answer truthfully if they know the answer, and randomly if they do not know.

What sequence of questions will give you the greatest chance of locating the chest with the treasure? For what values of N and C is success guaranteed?

No Solution Yet Submitted by K Sengupta    
Rating: 2.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some Thoughtsre: simulationCharlie2024-03-20 13:44:45
Some ThoughtssimulationCharlie2024-03-20 13:24:49
Some Thoughtsre: a start for a way to goCharlie2024-03-20 08:19:51
Some Thoughtsa start for a way to goCharlie2024-03-20 07:35:38
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information