A Discrete Search Game
Gal Shmuel · SIAM Journal on Applied Mathematics · 1974
We consider the following search game: the first player, to be called the hider, chooses y, an integer from the set of integers 1 to N. The second player, to be called the searcher, guesses an integer from 1 to N and is told whether his guess is or is not too low; he continues to guess until he identifies y. The payoff to the hider is the number of guesses by the searcher. We present the optimal (mixed) strategies for both players and the value of this game.