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

游戏是一项艰苦的工作,但必须有人去做!

Gaming is a hard job, but someone has to do it!

Giovanni Viglietta

摘要:

我们建立了一些一般性的方案,将电子游戏的计算复杂性与某些常见元素或机制的存在联系起来,例如可破坏的路径,可收集的物品,由钥匙打开或由按钮或压板激活的门等。然后我们将这些“元定理”应用于1980年至1998年期间出版的几款电子游戏,包括Pac-Man,Tron,Lode Runner,Boulder Dash,Deflektor,头脑风暴,烟斗狂,Skweek,波斯王子,旅鼠,厄运,泡泡龙3和星际争霸。我们得到新的结果,和以前已知的结果的改进或替代证明。

英文摘要:

We establish some general schemes relating the computational complexity of a video game to the presence of certain common elements or mechanics, such as destroyable paths, collectible items, doors opened by keys or activated by buttons or pressure plates, etc. Then we apply such "metatheorems" to several video games published between 1980 and 1998, including Pac-Man, Tron, Lode Runner, Boulder Dash, Deflektor, Mindbender, Pipe Mania, Skweek, Prince of Persia, Lemmings, Doom, Puzzle Bobble~3, and Starcraft. We obtain both new results, and improvements or alternative proofs of previously known results.

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

↑