Hide and seek with imperfect searches
A hider chooses one of three hiding spots and a seeker, without seeing the choice, searches exactly one spot. If the seeker searches the hider's spot, the hider is found with probability (spot 1), (spot 2) or (spot 3); searching any other spot never finds the hider. Both may randomise. The hider wants to minimise and the seeker to maximise the probability of a find. Under optimal play by both (the minimax mixed strategies), what is the probability that the hider is found? Give a decimal to four places.
Show hints (2)+
- If the hider's mix is q, searching spot i succeeds with probability . What should the hider do with these three numbers?
- Make them all equal, then check that the seeker can guarantee the same value.
Answer
Reveal answer →Final answer
0.1636 (± 0.001)
Create a free account to see the full worked solution and track your progress.
Interview format: Trading Aptitude Tests, Betting Game Rounds