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 that shows that the problem of solving a level in 'Super Mario Brothers' is as hard as ...

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

Computational complexity and equilibrium analysis form an interrelated field at the crossroads of theoretical computer science and game theory. Researchers in this area investigate the intrinsic ...

Having been invented in the US in the mid-20th century, Scrabble is now available in dozens of languages and sells in numbers measured in hundreds of millions. That makes it one of the most popular ...

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.