魔术:聚会像算术一样难
Magic: the Gathering is as Hard as Arithmetic
摘要:
Magic:The Gathering是一款关于魔法战斗的流行且着名的复杂纸牌游戏。最近,包括Chatterjee和Ibsen-Jensen(2016)和Churchill,Biderman和Herrick(2019)在内的几位作者研究了最佳发挥Magic的计算复杂性。在本文中,我们表明,“队友在$n$”的魔术问题是$Δ^0_n$ -硬和最佳发挥在两个球员魔术一般是非算术。这些结果适用于如何真正的魔术是发挥,可以实现使用标准大小的比赛法律甲板,并不依赖于随机性或隐藏的信息。我们的论文建立在Churchill,Biderman和Herrick(2019)用来表明这个问题至少和停机问题一样困难的基础上。
英文摘要:
Magic: the Gathering is a popular and famously complicated card game about magical combat. Recently, several authors including Chatterjee and Ibsen-Jensen (2016) and Churchill, Biderman, and Herrick (2019) have investigated the computational complexity of playing Magic optimally. In this paper we show that the ``mate-in-$n$'' problem for Magic is $Δ^0_n$-hard and that optimal play in two-player Magic is non-arithmetic in general. These results apply to how real Magic is played, can be achieved using standard-size tournament legal decks, and do not rely on stochasticity or hidden information. Our paper builds upon the construction that Churchill, Biderman, and Herrick (2019) used to show that this problem was at least as hard as the halting problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。