A number is chosen uniformly from the set {1, 2, …, 8}.Playe…
A number is chosen uniformly from the set {1, 2, …, 8}.Player I guesses the number and after each guess receives the responses: too high too low correct Assume Player I uses optimal binary search. What is the maximum number of guesses required? What is Player I’s payoff if the payoff equals −(number of guesses) and the number is found in 3 guesses?