In the last few years, a few dedicated mathematicians have begun to study the computational complexity of video games. Their goal is to determine the inherent difficulty of the games and how they ...

Completing a game of "Super Mario Brothers" can be hard -- very, very hard. That's the conclusion of a new paper from researchers at MIT, the University of Ottawa, and Bard College at Simon's Rock.

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 ...

In computational complexity theory, P and NP are two classes of problems. P is the class of decision problems that a deterministic Turing machine can solve in polynomial time. In useful terms, any ...

They have a mathematical, analog “solver” that can potentially find the best solution to NP-hard problems. NP-hardness is a theory of computational complexity, with problems that are famous for their ...

Back in January we looked at the work of Giovanni Viglietta at the University if Pisa in Italy who had proved the computational complexity of many computer games from the 80s and 90s, such as Pac-Man ...

Completing a game of 'Super Mario Brothers' can be hard -- very, very hard. That's the conclusion of a new paper that shows that the problem of solving a level in 'Super Mario Brothers' is as hard as ...