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.

翻译：本文分析了任天堂Game Boy掌上游戏机平台上发行的多款热门电子游戏的计算复杂性。我们研究了四款经典Game Boy游戏（《大金刚》《瓦力欧乐园》《牧场物语GB》和《鼹鼠玛尼亚》）广义版本的计算复杂度，并首次通过形式化证明揭示了这些游戏均属于\textbf{NP}-难问题。我们的证明基于卡普提出的21个经典\textbf{NP}-完全问题中的四个问题（\textsc{可满足性问题}、\textsc{3-CNF可满足性问题}、\textsc{哈密顿回路问题}和\textsc{背包问题}）进行卡普归约。此外，我们还通过现有结论推导出《迷宫追逐》与《狮子王》两款游戏同样具有\textbf{NP}-难复杂性的证明路径。