Consider the following game: Player A chooses an integer $\alpha$ between $1$ and $n$ for some integer $n\geq1$, but does not reveal $\alpha$ to Player B. Player B then asks Player A a yes/no question about which number Player A chose, after which Player A responds truthfully with either ``yes'' or ``no.'' After a predetermined number $m$ of questions have been asked ($m\geq 1$), Player B must attempt to guess the number chosen by Player A. Player B wins if she guesses $\alpha$. The purpose of this note is to find, for every $m\geq 1$, all canonical $m$-question algorithms which maximize the probability of Player B winning the game (the notion of ``canonical algorithm'' will be made precise in Section 3).
"I'm Thinking of a Number $\ldots$." Missouri J. Math. Sci. 28 (1) 31 - 48, May 2016. https://doi.org/10.35834/mjms/1474295354