Magic:The Gathering Is Turing Complete(图灵完成)
Magic: The Gathering is Turing Complete
摘要:
$\textit{Magic: The Gathering}$是一个流行的和著名的复杂的交易卡游戏关于魔法战斗。在本文中,我们表明,在现实世界中的最佳发挥$\textit{Magic}$至少是一样困难的停机问题,解决了一个问题,已经开放了十年。为了做到这一点,我们提出了一种方法,用于将任意图灵机嵌入到$\textit{Magic}$的游戏中,使得当且仅当图灵机停止时,第一个玩家保证赢得游戏。我们的研究结果适用于如何发挥真正的$\textit{Magic}$,可以实现使用标准大小的比赛,法律甲板,并不依赖于随机性或隐藏的信息。我们的结果也是非常不寻常的,因为双方球员的所有动作都是被迫的。这表明,即使认识到谁将赢得一场比赛,其中没有一个球员有一个重要的决定,以使其余的游戏是不可判定的。最后,我们讨论的影响,一个统一的计算理论的游戏和评论的可玩性,这样一个董事会在比赛设置。
英文摘要:
$\textit{Magic: The Gathering}$ is a popular and famously complicated trading card game about magical combat. In this paper we show that optimal play in real-world $\textit{Magic}$ is at least as hard as the Halting Problem, solving a problem that has been open for a decade. To do this, we present a methodology for embedding an arbitrary Turing machine into a game of $\textit{Magic}$ such that the first player is guaranteed to win the game if and only if the Turing machine halts. Our result applies to how real $\textit{Magic}$ is played, can be achieved using standard-size tournament-legal decks, and does not rely on stochasticity or hidden information. Our result is also highly unusual in that all moves of both players are forced in the construction. This shows that even recognising who will win a game in which neither player has a non-trivial decision to make for the rest of the game is undecidable. We conclude with a discussion of the implications for a unified computational theory of games and remarks about the playability of such a board in a tournament setting.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。