New answers tagged

1 vote

Minimum number of questions for real treasure

The number of questions you need to ask to take possession of the real treasure is only And this is how this is possible
Florian F's user avatar
  • 28.9k
1 vote

Minimum number of questions for real treasure

halogenlampert's user avatar
12 votes
Accepted

Minimum number of questions for real treasure

This can be used as a binary search as you suggest, giving $\log_2(2000)$ or 11 questions in all cases.
Sirv's user avatar
  • 236
0 votes

Minimum number of questions for real treasure

As some commenters have implied, there is a solution with fewer than the other answers have proposed. However,
Greg Martin's user avatar
  • 1,164
2 votes

Minimum number of questions for real treasure

Retudin's user avatar
  • 8,428
3 votes

Minimum number of questions for real treasure

So if your definition of minimum includes good luck, 11. If it means minimum even with the worst luck, 12.
Kate Gregory's user avatar
  • 5,762
0 votes

Two doors, two guards, and two keys

I would ask the left guard: Then:
3-1-4-One-Five's user avatar
5 votes

Lions vs. Pokémon

Here is an improvement over hexomino's answer. I.e. a simpler one. That this is minimal has been explained by hexomino. This is how it is achievable.
Florian F's user avatar
  • 28.9k
0 votes

Murder Mystery. Who is the killer?

I think it might have been: My train of thought: Liars: Reasoning: Motive: Method:
oopoopoop's user avatar
7 votes

Lions vs. Pokémon

I think the answer is Proof of lower bound Proof of upper bound
hexomino's user avatar
  • 136k

Top 50 recent answers are included