Abstract:The MandM Game involves two players who begin with I1 and I2 MandM's. During each round, each player tosses a fair coin: if the coin lands heads, that player eats one MandM, and if it lands tails, the player does not eat. If, at the end of a round, one player still has MandM's while the other has none, then the player with MandM's remaining is declared the winner. If both players eat their last MandM in the same round, the game is said to end in a tie. In [BHM+17], the authors studied the probability of a tie in the MandM Game and derived a simple closed-form expression in the special case where both players start with the same number of MandM's. We generalize the MandM Game in several directions, including allowing players to toss multiple coins per round and modifying the probability distributions of the coin flips. We use the technique of generating functions, Monte Carlo methods, and non-linear curve fitting to study the generalized MandM Game.
From: Wang Xiaochen [view email]
[v1]
Tue, 11 Feb 2025 09:31:02 UTC (823 KB)
[v2]
Wed, 18 Mar 2026 15:20:33 UTC (602 KB)
[v3]
Wed, 3 Jun 2026 04:25:54 UTC (516 KB)
[v4]
Wed, 1 Jul 2026 02:53:29 UTC (681 KB)
[v5]
Mon, 27 Jul 2026 05:51:39 UTC (531 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。