The Computational Complexity of Angry Birds (Extended Abstract)

Matthew Stephenson; Jochen Renz; Xiaoyu Ge

doi:10.24963/IJCAI.2020/716

The Computational Complexity of Angry Birds (Extended Abstract)

Matthew Stephenson^*
, Jochen Renz
, Xiaoyu Ge

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

Abstract

In this paper we present several proofs for the computational complexity of the physics-based video game Angry Birds. We are able to demonstrate that solving levels for different versions of Angry Birds is either NP-hard, PSPACE-hard, PSPACE-complete or EXPTIME-hard, depending on the maximum number of birds available and whether the game engine is deterministic or stochastic. We believe that this is the first time that a single-player video game has been proven EXPTIME-hard.

Original language	English
Title of host publication	Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI-20)
Pages	5105-5109
DOIs	https://doi.org/10.24963/IJCAI.2020/716
Publication status	Published - Jul 2020
Event	29th International Joint Conference on Artificial Intelligence - Online, Yokohama, Japan Duration: 7 Jan 2021 → 15 Jan 2021 Conference number: 29 https://ijcai20.org/

Conference

Conference	29th International Joint Conference on Artificial Intelligence
Abbreviated title	IJCAI 2020
Country/Territory	Japan
City	Yokohama
Period	7/01/21 → 15/01/21
Internet address	https://ijcai20.org/

Access to Document

10.24963/IJCAI.2020/716

Cite this

@inproceedings{4ba3c296acf44ea8a690db2f157b245f,

title = "The Computational Complexity of Angry Birds (Extended Abstract)",

abstract = "In this paper we present several proofs for the computational complexity of the physics-based video game Angry Birds. We are able to demonstrate that solving levels for different versions of Angry Birds is either NP-hard, PSPACE-hard, PSPACE-complete or EXPTIME-hard, depending on the maximum number of birds available and whether the game engine is deterministic or stochastic. We believe that this is the first time that a single-player video game has been proven EXPTIME-hard.",

author = "Matthew Stephenson and Jochen Renz and Xiaoyu Ge",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.; 29th International Joint Conference on Artificial Intelligence <br/>, IJCAI 2020 ; Conference date: 07-01-2021 Through 15-01-2021",

year = "2020",

month = jul,

doi = "10.24963/IJCAI.2020/716",

language = "English",

pages = "5105--5109",

booktitle = "Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI-20)",

url = "https://ijcai20.org/",

}

TY - GEN

T1 - The Computational Complexity of Angry Birds (Extended Abstract)

AU - Stephenson, Matthew

AU - Renz, Jochen

AU - Ge, Xiaoyu

N1 - Conference code: 29

PY - 2020/7

Y1 - 2020/7

N2 - In this paper we present several proofs for the computational complexity of the physics-based video game Angry Birds. We are able to demonstrate that solving levels for different versions of Angry Birds is either NP-hard, PSPACE-hard, PSPACE-complete or EXPTIME-hard, depending on the maximum number of birds available and whether the game engine is deterministic or stochastic. We believe that this is the first time that a single-player video game has been proven EXPTIME-hard.

AB - In this paper we present several proofs for the computational complexity of the physics-based video game Angry Birds. We are able to demonstrate that solving levels for different versions of Angry Birds is either NP-hard, PSPACE-hard, PSPACE-complete or EXPTIME-hard, depending on the maximum number of birds available and whether the game engine is deterministic or stochastic. We believe that this is the first time that a single-player video game has been proven EXPTIME-hard.

U2 - 10.24963/IJCAI.2020/716

DO - 10.24963/IJCAI.2020/716

M3 - Conference article in proceeding

SP - 5105

EP - 5109

BT - Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI-20)

T2 - 29th International Joint Conference on Artificial Intelligence <br/>

Y2 - 7 January 2021 through 15 January 2021

ER -

The Computational Complexity of Angry Birds (Extended Abstract)

Abstract

Conference

Access to Document

Fingerprint

Cite this