‘猜谁’游戏中的最优策略：超越二分搜索
Optimal Strategy in "Guess Who?": Beyond Binary Search
AI总结：
‘猜谁’游戏中的最优策略并非简单的二分搜索，而是通过大胆的策略来追上对手，突破传统认知。
摘要：
‘猜谁’是一种两人游戏，玩家通过‘是’或‘否’的问题来从可能的候选人中寻找对方的神秘身份。这被建模为一个简单的随机游戏。利用这个模型，找到了最优策略。与普遍看法相反，进行二分搜索并不总是最优的。相反，处于落后位置的玩家应采取大胆的行动以追上对手。这是通过首先分析一个连续版本的游戏发现的，其中玩家无限进行游戏，且在有限轮次后无法决定胜负。
英文摘要：
"Guess Who?" is a popular two player game where players ask "Yes"/"No" questions to search for their opponent's secret identity from a pool of possible candidates. This is modeled as a simple stochastic game. Using this model, the optimal strategy is explicitly found. Contrary to popular belief, performing a binary search is \emph{not} always optimal. Instead, the optimal strategy for the player who trails is to make certain bold plays in an attempt catch up. This is discovered by first analyzing a continuous version of the game where players play indefinitely and the winner is never decided after finitely many rounds.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
