广义Alice HH vs Bob HT问题
The generalized Alice HH vs Bob HT problem
AI总结:
本文将Daniel Litt提出的HH vs HT抛硬币游戏推广到任意有限字母表的等长子串场景,通过离散马尔可夫链的Edgeworth展开,发现子串前缀/后缀自重叠程度决定胜负,重叠更多者输。
摘要:
2024年,Daniel Litt提出了一个简单的抛硬币游戏,Alice选择“正面-正面”(HH),Bob选择“正面-反面”(HT):在n次公平抛硬币的序列中,谁的子串出现次数更多的概率更高?该问题在X平台获得超100万次浏览,并迅速催生多篇解释反直觉解法的文章。我们研究广义游戏:将硬币结果集{正面,反面}推广到任意有限字母表A,Alice和Bob的子串为任意等长的A-字符串。我们发现,Litt游戏的胜者可由单个量决定,该量衡量每个字符串的前缀/后缀自重叠程度;自重叠更多的字符串持有者会输。例如,原问题中“HT”击败“HH”,因“HH”的前缀/后缀重叠长度为1,而“HT”无重叠。证明方法是为离散马尔可夫链推导精确的Edgeworth展开,并应用它计算Alice和Bob获胜概率,精度达O(1/n)阶。
英文摘要:
In 2024, Daniel Litt posed a simple coinflip game pitting Alice's "Heads-Heads" vs Bob's "Heads-Tails": who is more likely to win if they score 1 point per occurrence of their substring in a sequence of n fair coinflips? This attracted over 1 million views on X and quickly spawned several articles explaining the counterintuitive solution. We study the generalized game, where the set of coin outcomes, {Heads, Tails}, is generalized to an arbitrary finite alphabet A, and where Alice's and Bob's substrings are any finite A-strings of the same length. We find that the winner of Litt's game can be determined by a single quantity which measures the amount of prefix/suffix self-overlaps in each string; whoever's string has more overlaps loses. For example, "Heads-Tails" beats "Heads-Heads" in the original problem because "Heads-Heads" has a prefix/suffix overlap of length 1 while "Heads-Tails" has none. The method of proof is to develop a precise Edgeworth expansion for discreteMarkov chains, and apply this to calculate Alice's and Bob's probability to win the game correct to order O(1/n).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。