arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1003.2851cs.DMcs.CC
收藏

UNO的复杂性

The complexity of UNO

Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno

摘要:

本文从算法组合对策论的角度研究了流行的纸牌游戏UNO。我们定义了简单和简洁的数学模型的游戏,包括合作和非合作的版本,并分析其计算复杂性。特别是,我们证明,即使是一个单一的球员版本的UNO是NP完全的,虽然一些限制的情况下,在P.令人惊讶的是,我们表明,不合作的两个球员的版本也在P。

英文摘要:

This paper investigates the popular card game UNO from the viewpoint of algorithmic combinatorial game theory. We define simple and concise mathematical models for the game, including both cooperative and uncooperative versions, and analyze their computational complexity. In particular, we prove that even a single-player version of UNO is NP-complete, although some restricted cases are in P. Surprisingly, we show that the uncooperative two-player version is also in P.

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

↑