Pac-Man Is NP-Hard

Assuming that this method of measuring complexity is actually useful, is there an ideal level of theoretical complexity in a computer game?

(This is not necessarily the same as the complexity of play - Doom is, after all, very easy to play but PSPACE-hard problems are extremely difficult problems to solve.)

Any retro-gamers here want to determine the theoretical complexity of Wizardry, Atic Atac, Knightlore, Citadel or Cholo?

Is there any correlation between the complexity and how long the game stuck in people

Source: http://rss.slashdot.org/~r/Slashdot/slashdotScience/~3/3nfltwimYbE/pac-man-is-np-hard

the closer michael turner split pea soup land of the lost cleveland cavaliers cleveland cavaliers war horse