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

Game Boy游戏的计算复杂度

Computational Complexity of Game Boy Games

Hayder Tirmazi, Ali Tirmazi, Tien Phuoc Tran

AI总结:

本文分析了任天堂Game Boy平台四款流行游戏的广义版本复杂度,通过Karp归约提供了其NP-hard的原创证明,并讨论了其他相关游戏的NP-hardness。

摘要:

我们分析了任天堂Game Boy游戏机发布的几款流行电子游戏的计算复杂度。我们分析了四款流行Game Boy游戏的广义版本复杂度:Donkey Kong、Wario Land、Harvest Moon GB和Mole Mania。我们提供了原创证明,表明这些游戏是NP-hard的。我们的证明依赖于从Karp最初的21个NP-complete问题中的四个问题:Sat、3-Cnf-Sat、Hamiltonian Cycle和Knapsack进行的Karp归约。我们还讨论了基于已知结果易于推导的证明,以展示Lock `n' Chase和The Lion King的NP-hardness。

英文摘要:

We analyze the computational complexity of several popular video games released for the Nintendo Game Boy video game console. We analyze the complexity of generalized versions of four popular Game Boy games: Donkey Kong, Wario Land, Harvest Moon GB, and Mole Mania. We provide original proofs showing that these games are \textbf{NP}-hard. Our proofs rely on Karp reductions from four of Karp's original 21 \textbf{NP}-complete problems: \textsc{Sat}, \textsc{3-Cnf-Sat}, \textsc{Hamiltonian Cycle}, and \textsc{Knapsack}. We also discuss proofs easily derived from known results demonstrating the \textbf{NP}-hardness of Lock `n' Chase and The Lion King.

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

↑