发表机构
University of Oklahoma（俄克拉荷马大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文证明卡牌游戏Riftbound具备图灵完备性，通过锦标赛合法卡组构造通用图灵机，并展示在单回合内完成构建与计算的可能性。
AI 中文摘要
Riftbound：英雄联盟卡牌游戏是一款关于在占山为王式竞赛中占领并控制位置的集换式卡牌游戏。该游戏最初于2025年8月在中国发布，随后于2025年10月在美国发布，因其深度和复杂性而广受好评。在本文中，我们通过提供一系列有效的游戏状态序列来展示这种复杂性的一个方面，这些状态在游戏内构建了通用图灵机。每台这样的机器在撰写本文时均使用锦标赛合法卡组构建，所分配的策略由游戏状态指导。我们还表明，在给定适当的棋盘状态下，机器可以在一个游戏回合内构建并完成计算。
英文摘要
Riftbound: League of Legends Trading Card Game is a trading card game about capturing and holding locations in a king-of-the-hill style contest. Originally released in China in August of 2025, and later released in the United States in October of 2025, the game has been well received for its depth and complexity. In this paper we demonstrate a facet of this complexity by providing sequences of valid game states which construct Universal Turing machines within the game. Each of these machines are constructed with tournament legal decks at the time of writing and strategies assigned are directed by the game state. We also show that given an appropriate board state the machine may be constructed and the computation may be performed in one game turn.
Comments17 Pages, 4 Tables
