The Computational Complexity of Angry Birds

by   Matthew Stephenson, et al.

The physics-based simulation game Angry Birds has been heavily researched by the AI community over the past five years, and has been the subject of a popular AI competition that is being held annually as part of a leading AI conference. Developing intelligent agents that can play this game effectively has been an incredibly complex and challenging problem for traditional AI techniques to solve, even though the game is simple enough that any human player could learn and master it within a short time. In this paper we analyse how hard the problem really is, presenting several proofs for the computational complexity of Angry Birds. By using a combination of several gadgets within this game's environment, we are able to demonstrate that the decision problem of solving general levels for different versions of Angry Birds is either NP-hard, PSPACE-hard, PSPACE-complete or EXPTIME-complete. Proof of NP-hardness is by reduction from 3-SAT, whilst proof of PSPACE-hardness is by reduction from True Quantified Boolean Formula (TQBF). Proof of EXPTIME-hardness is by reduction from G2, a known EXPTIME-complete problem similar to that used for many previous games such as Chess, Go and Checkers. To the best of our knowledge, this is the first time that a single-player game has been proven EXPTIME-complete. This is achieved by using stochastic game engine dynamics to effectively model the real world, or in our case the physics simulator, as the opponent against which we are playing. These proofs can also be extended to other physics-based games with similar mechanics.


page 2

page 8

page 9


The Legend of Zelda: The Complexity of Mechanics

We analyze some of the many game mechanics available to Link in the clas...

A Note on Computational Complexity of Dou Shou Qi

Dou Shou Qi is a Chinese strategy board game for two players. We use a E...

The Computational Complexity of Fire Emblem Series and similar Tactical Role-Playing Games

Fire Emblem (FE) is a popular turn-based tactical role-playing game (TRP...

Magic: the Gathering is as Hard as Arithmetic

Magic: the Gathering is a popular and famously complicated card game abo...

Perfect Information Hearthstone is PSPACE-hard

We consider the computational complexity of Hearthstone which is a popul...

Inducing game rules from varying quality game play

General Game Playing (GGP) is a framework in which an artificial intelli...

Training an Assassin AI for The Resistance: Avalon

The Resistance: Avalon is a partially observable social deduction game. ...

Please sign up or login with your details

Forgot password? Click here to reset