News for hackers. Stuff that matters.
Re:Pac-Man Proved NP-Hard by blauwbilgorgel on Friday January 27, 2012 @05:34AM (#3517833)
To rank the complexity of a game, as it relates to the user, couldn't you:

Record 1 hour of input in a string. Run a block level compression algo on it, and order the compressed strings on size?

Wouldn't that give a measure of the amount of input required by the game, coupled with how much of that input repeats/has simple patterns?

There are no comments on this comment yet.