Pac-Man Is NP-Hard
2012-01-27 10:11
381 查看
"An Italian researcher with a penchant for retro games — or perhaps just looking for an excuse to play games in the name of science! — has used computational complexity theory to decide, once and for all, just how hard video games are. In a truly epic undertaking, Giovanni Viglietta of the University of Pisa has worked out the theoretical difficulty of 13 old games, including Pac-Man, Doom, Lemmings, Prince of Persia, and Boulder Dash. Pac-Man, with its traversal of space, is NP-hard. Doom, on the other hand, is PSPACE-hard."
相关文章推荐
- 好人难寻 A Good Man Is Hard to Find 弗兰纳里 奥康纳
- NP,NP-hard,P,NP完全问题
- What Is a Hard Inquiry?(Fico信用查询之“硬查询”)
- NP-Hard Problemd(二分图判定着色)
- P,NP,NPC,NP-hard问题的概念
- linux常用命令-date/帮助信息/man/whatis/cal
- whereis+whatis+man
- P、NP、NPC和NP-hard问题的理解
- Google放PAC-Man游戏Doodle 支持单人双人游戏 绝对拉风
- It is hard to find the largest plasmid...
- zoj 3519 Who is the Smartest Man
- linux whatis与whatis database 使用及查询方法(man使用实例)
- P,NP,NP-hard,NPC
- 311.No man is wise at all times. 聪明一世,糊涂一时
- Is life always hard?
- 什么是NP问题,NP-complete和NP-hard问题.
- 17. A faithful friend is hard to find. 知音难觅
- *Linux常用命令学习2---(文件搜索命令locate find、命令搜索命令whereis which、字符串搜索命令grep、帮助命令man)
- 寒假练习 1004 Who is the Smartest Man
- 197. Happy is the man who learns from the misfortunes of others.吸取他人的教训,自己才会走运