You are playing a video game, your character is in a town of dragons and is runn

Question

You are playing a video game, your character is in a town of dragons and is running low on his life meter. There are 4 door in this town and each door is guarded by 10 dragons. You know that behind three of the four doors are bottomless pits and if you open one of them you will get sucked in and your character will die. The other door though has a magic sword behind it that will restore your life to full and will help you to defeat the saber-toothed bunny in the next level of the game. The dragons will answer your yes and no questions, but each dragon only knows what is behind his own door. Also, of the 40 dragons, three of them lie. Further, though the dragons are friendly, they have terrible breath and each time one speaks a word to you your life meter goes down. Devise a non-adaptive, way to determine which door the sword is behind that involves you asking as few yes/no questions as possible. Be sure to justify why your solution is optimal.

Explanation / Answer

As there are 10 dragons at each door we need to take the answer from most dragons as the correct answer as 3 dragons among them lie. So the question we need to ask them is will I loose the game if I open this door. If they say yes then we can proceed to the next door and if majority of them say no then that is the door we need to open. We know all those dragons answer our question and we also know only on edoor contains what we need. So the question we ask will be perfect to know which door is the door we want and hence our solution is optimal.

Related Questions

Navigate

• Browse (All)
• Browse Y
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.