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
simulation by Charlie)
It looks as if N doesn't matter, so I did a million trials for each value of C for N = 2:
C
1 1000000
2 750023
3 500449
4 375174
5 300908
6 250458
7 214703
8 187100
9 166170
10 150223
11 135509
12 125152
13 115428
14 107128
15 99680
16 93708
17 87941
18 83675
19 79047
20 75050
|
|
Posted by Charlie
on 2024-03-20 13:44:45 |
re: simulation
