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?
(In reply to
a start for a way to go by Charlie)
Every question asked gives you information of either who is not confirmed or the status of one of the chests. It seems that by the time N Plaminians have been asked, you have either information about N chests or N of the remaining Plaminians, or a combination thereof.
So C<=N would guarantee getting the treasure.
This assumes that unlike what I initially said, you sometimes ask about a Plaminian who you had previously asked a question of, rather than always the next one on the list.
Edited on March 20, 2024, 8:22 am
|
|
Posted by Charlie
on 2024-03-20 08:19:51 |
re: a start for a way to go
