I am thinking of an integer in the interval [115]. You are to try to guess it by telling me intervals and I will tell you if my number lies in that interval.
For example if my number is 6 and you guess [69] I will tell yes but if you guess [711] I will tell you no but not if my number is higher or lower.
You win by guessing an interval of just one number and that number is my number. Find a strategy that minimizes the expected number of guesses.
(In reply to
some thoughts by Steven Lord)
If n=4, choosing first 12 and then individual halves (the binary method), gives a probability of 1/2 of hitting the number on try 2 and 1/2 on trial 3 for an expected value of 5/2 = 2.5.
Choosing individual numbers in turn gives 1/4 of finding on any given try for an expected value of 10/4 = 2.5.
What about n=3? Individual numbers gives expected value 6/3 = 2. The binary method, if using the floor of half the remaining number as the size of the next guess is actually the same as the individual member method.

Posted by Charlie
on 20191023 13:37:56 