arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.02863math.LOcs.CCcs.GT
收藏

在《Yu-Gi-Oh!卡牌游戏》中决定胜利策略是困难的

Deciding winning strategies in Yu-Gi-Oh! TCG is hard

University of Torino(都灵大学);University of Udine(乌迪内大学);University of Pisa(比萨大学)

Orazio Nicolosi, Federico Pisciotta, Lorenzo Bresolin

AI总结:

研究证明《Yu-Gi-Oh!卡牌游戏》中判断特定策略是否为胜利问题是不可判定的,并且是Π¹₁-完全的。

摘要:

受[CBH20]和[Bid20]对《魔法:英雄冒险》研究成果的启发,我们研究了一个关于《Yu-Gi-Oh!卡牌游戏》中胜利策略的可计算性问题。我们证明了从给定的游戏状态出发,判断给定的可计算策略是否为胜利的问题是不可判定的。特别是,我们不仅证明了停机问题可以归约到该问题,而且证明该问题实际上是Π¹₁-完全的。我们还将这一结果扩展到所有策略,通过在可数良序集上的归约,这是一个经典的Π¹₁-完全集。对于这些归约,我们提出了两个合法的卡组(根据当前《Yu-Gi-Oh!卡牌游戏》的禁用与限制清单),玩家先手可以使用它们来执行这些归约。

英文摘要:

Motivated by the results for Magic: The Gathering presented in [CBH20] and [Bid20], we study a (different) computability problem about winning strategies in Yu-Gi-Oh! Trading Card Game, a popular card game developed and published by Konami. We show that the problem of establishing whether, from a given game state, a given computable strategy is winning is undecidable. In particular, not only do we prove that the Halting Problem can be reduced to this problem, but also that this problem is actually $Π^1_1$-complete. We extend this last result to all strategies with a reduction on the set of countable well orders, a classic $\boldsymbolΠ^1_1$-complete set. For these reductions, we present two legal decks (according to the current Forbidden & Limited List of Yu-Gi-Oh! Trading Card Game) that can be used by the player who goes first to perform them.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑