High-low search for a point in an interval
Mubarak A. Shah · Research Repository (Delft University of Technology) · 2011
Analysis of the high-low search game for a point on an interval. By limiting the number of guesses for the searcher, it is possible to study the game numerically. The principal motivation for this analysis is an old and open question due to Baston, Bostock and Alpern: is the optimal strategy for the searcher pure? The answer is no if the number of guesses is 3.