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 | |
Publication status | Published - Jul 2020 |
Event | 29yh International Joint Conference on Artificial Intelligence - Online, Yokohama, Japan Duration: 7 Jan 2021 → 15 Jan 2021 Conference number: 29 https://ijcai20.org/ |
Conference
Conference | 29yh International Joint Conference on Artificial Intelligence |
---|---|
Abbreviated title | IJCAI 2020 |
Country/Territory | Japan |
City | Yokohama |
Period | 7/01/21 → 15/01/21 |
Internet address |