The Computational Complexity of Angry Birds

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 currently held annually as part of a leading AI conference. Developing intelligent agents that can play this game effec...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org
Main Authors: Stephenson, Matthew, Renz, Jochen, Ge, Xiaoyu
Format: Paper
Language:English
Published: Ithaca Cornell University Library, arXiv.org 15.01.2020
Subjects:
Artificial intelligence
Boolean algebra
Checkers
Chess
Complexity
Computation
Computer simulation
Games
Hardness
Intelligent agents
Physics
Reduction
ISSN:2331-8422
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 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 currently 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-hard. 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-hard. 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.
AbstractList 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 currently 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-hard. 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-hard. 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.
Author Ge, Xiaoyu
Stephenson, Matthew
Renz, Jochen
Author_xml – sequence: 1
  givenname: Matthew
  surname: Stephenson
  fullname: Stephenson, Matthew
– sequence: 2
  givenname: Jochen
  surname: Renz
  fullname: Renz, Jochen
– sequence: 3
  givenname: Xiaoyu
  surname: Ge
  fullname: Ge, Xiaoyu
BookMark eNotjs9LwzAYQIMoOOf-AG8Fj9KafF--JT3O4lQYeOl9ZPmhHbWZSSvbf6-op8e7PN4VOx_i4Bm7EbySmojfm3TsviqhBVRcqRrP2AwQRaklwCVb5LznnMNSARHO2F377osmfhym0YxdHEz_a70_duOpiKFYDW_pVDx0yeVrdhFMn_3in3PWrh_b5rncvD69NKtNaQhkaaXbabEUwYEDMtYZUVsyQteKrDUSdmhq1JYrgc77QNJh8FpZjlISDzhnt3_ZQ4qfk8_jdh-n9HOWtyCo5kBSS_wGPHJE5Q
ContentType Paper
Copyright 2020. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2020. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.48550/arxiv.1812.07793
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
Technology collection
ProQuest One Community College
ProQuest Central
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
ProQuest Databases
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering collection
DatabaseTitle Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 2331-8422
Genre Working Paper/Pre-Print
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FRJ
HCIFZ
L6V
M7S
M~E
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
ID FETCH-LOGICAL-a524-c4db8161fd2d25acda19c5a18975cca42b3a938c0713deef54d3fe87c034450f3
IEDL.DBID M7S
IngestDate Mon Jun 30 09:34:03 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a524-c4db8161fd2d25acda19c5a18975cca42b3a938c0713deef54d3fe87c034450f3
Notes SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
OpenAccessLink https://www.proquest.com/docview/2159025484?pq-origsite=%requestingapplication%
PQID 2159025484
PQPubID 2050157
ParticipantIDs proquest_journals_2159025484
PublicationCentury 2000
PublicationDate 20200115
PublicationDateYYYYMMDD 2020-01-15
PublicationDate_xml – month: 01
  year: 2020
  text: 20200115
  day: 15
PublicationDecade 2020
PublicationPlace Ithaca
PublicationPlace_xml – name: Ithaca
PublicationTitle arXiv.org
PublicationYear 2020
Publisher Cornell University Library, arXiv.org
Publisher_xml – name: Cornell University Library, arXiv.org
SSID ssj0002672553
Score 1.7109319
SecondaryResourceType preprint
Snippet 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...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Artificial intelligence
Boolean algebra
Checkers
Chess
Complexity
Computation
Computer simulation
Games
Hardness
Intelligent agents
Physics
Reduction
Title The Computational Complexity of Angry Birds
URI https://www.proquest.com/docview/2159025484
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB60VfDkGx-17MFr2s1uspucxEqLgpZFe6inks1DetnW3VrsvzdJtwoevHgMgZBhknl8M3wDcK1xkhAVcqRSkzvohiMhFEGaccolV8zknmf2MR0O2XjMsxpwq-q2yo1N9IZazaTDyLvWNbmKGGHkZv6O3NQoV12tR2hsQ9OxJGDfuvfyjbFESWoj5nhdzPTUXV1Rfk6XHefWOmGaunLzLxPs_cpg_783OoBmJua6PIQtXRzBru_nlNUxuE6KYD2xoUb7_MqxXy5WwcwEt8VbuQp601JVJzAa9Ed396iei4AEjQiSROXMBmpGRSqiQiqBuaQCM55Sqw8S5bHgMZMu_1RaG0pUbDRLpWP3o6GJT6FRzAp9BgG34aA9RtiPTmyipRlTcYxxnksT6kSYc2htRJ_Ub7ua_Mh98ff2JexFLjsNMcK0BY1F-aGvYEcuF9OqbEOz1x9mz22vMrvKHp6y1y-ThKEQ
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1R3LTgIxcIKg0ZPv-EDdgx4Lu93ubnswxheBgIREDtxItw_DZcFdRPko_9F2YTXx4I2Dx6ZJM52ZzrszAJfKC0MiXYZkpGMbumGIc0mQoixggkmq47zPbCfqdulgwHol-Cz-wtiyykIm5oJajoWNkdeNarIZMULJzeQV2alRNrtajNBYsEVbzd-Ny5Zdtx4Mfa8wbjz275toOVUA8QATJIiMqTFztMQSB1xI7jERcI-yKDC3ITj2OfOpsN6bVEoHRPpa0UjY3niBq31z7BpUjBWBWV4p-Pwd0sFhZAx0f5E7zTuF1Xn6MZrVrBatuVFks9u_JH6uxhrb_wwBO1Dp8YlKd6Gkkj3YyKtVRbYPtk7EWcyjWMYy85Xt7TmdO2Pt3CYv6dy5GxkgD6C_CvAOoZyME3UEDjPGrjmGGzFGjBupKJW-73lxLLSrQq6PoVpgerh8udnwB80nf29fwGaz_9QZdlrd9ilsYeuHux7ygiqUp-mbOoN1MZuOsvQ85xIHhismyhdfd_qO
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+Computational+Complexity+of+Angry+Birds&rft.jtitle=arXiv.org&rft.au=Stephenson%2C+Matthew&rft.au=Renz%2C+Jochen&rft.au=Ge%2C+Xiaoyu&rft.date=2020-01-15&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.1812.07793