{"type":"ScholarlyArticle","title":"The Computational Complexity of Angry Birds (Extended Abstract)","authors":[{"name":"Matthew Stephenson","slug":"matthew-stephenson","given":"Matthew","family":"Stephenson","affiliation":"Department of Data Science and Knowledge Engineering , Maastricht University , the Netherlands"},{"name":"Jochen Renz","slug":"jochen-renz","given":"Jochen","family":"Renz","affiliation":"Research School of Computer Science , Australian National University , Canberra , Australia"},{"name":"Xiaoyu Ge","slug":"xiaoyu-ge","given":"Xiaoyu","family":"Ge","affiliation":"Research School of Computer Science , Australian National University , Canberra , Australia"}],"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.","doi":"10.24963/ijcai.2020/716","url":"https://ijcai.org/proceedings/2020/716","pdf":"https://ijcai.org/proceedings/2020/0716.pdf","markdown":"https://ijcai.org/proceedings/2020/716.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/716","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Journal track","track":"Journal track","number":716,"pages":{"first":5105,"last":5109},"keywords":["Knowledge Representation and Reasoning: Computational Complexity of Reasoning","Multidisciplinary Topics and Applications: Computer Games"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24307/file_24307.m3u8","length_sec":248,"provider":"hls"}],"references":[{"position":1,"raw":"[Aloupis et al., 2014] Greg Aloupis, Erik D. Demaine, Alan Guo, and Giovanni Viglietta. Classic Nintendo games are (computationally) hard. In Proceedings of the 7th Interna- tional Conference on Fun with Algorithms, pages 40-51, 2014.","title":"Classic Nintendo games are (computationally) hard","authors":"Greg Aloupis, Erik D Demaine, Alan Guo, Giovanni Viglietta","year":"2014","venue":"Proceedings of the 7th International Conference on Fun with Algorithms","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Arora and Barak, 2009] Sanjeev Arora and Boaz Barak. Computational Complexity: A Modern Approach. Cam- bridge University Press, New York, NY, USA, 1st edition, 2009.","title":"Computational Complexity: A Modern Approach","authors":"Sanjeev Arora, Boaz Barak","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bosboom et al., 2018] Jeffrey Bosboom, Erik D. Demaine, Adam Hesterberg, Jayson Lynch, and Erik Waingarten. Mario Kart is hard. In MIT Open Access Articles, pages 1-12, 2018.","title":"Mario Kart is hard","authors":"Jeffrey Bosboom, Erik D Demaine, Adam Hesterberg, Jayson Lynch, Erik Waingarten","year":"2018","venue":"MIT Open Access Articles","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Demaine et al., 2016a] Erik D. Demaine, Joshua Lock- hart, and Jayson Lynch. The computational com- plexity of Portal and other 3D video games. CoRR, arXiv:1611.10319:1-24, 2016.","title":"The computational complexity of Portal and other 3D video games","authors":"Demaine","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Demaine et al., 2016b] Erik D. Demaine, Giovanni Vigli- etta, and Aaron Williams. Super Mario Bros. is harder/easier than we thought. In Proceedings of the 8th International Conference on Fun with Algorithms, pages 1-15, 2016.","title":"Super Mario Bros. is harder/easier than we thought","authors":"Demaine","year":"2016","venue":"Proceedings of the 8th International Conference on Fun with Algorithms","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Forišek, 2010] Michal Forišek. Computational complexity of two-dimensional platform games. In Proceedings of the 5th International Conference on Fun with Algorithms, pages 214-227, 2010.","title":"Michal Forišek. Computational complexity of two-dimensional platform games","authors":"Forišek","year":"2010","venue":"Proceedings of the 5th International Conference on Fun with Algorithms","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Gualà et al., 2014] Luciano Gualà, Stefano Leucci, and Emanuele Natale. Bejeweled, Candy Crush and other match-three games are (NP-)hard. In Proceedings of the 2014 IEEE Conference on Computational Intelligence and Games, pages 1-8, 2014.","title":"Bejeweled, Candy Crush and other match-three games are (NP-)hard","authors":"Luciano Gualà, Stefano Leucci, Emanuele Natale","year":"2014","venue":"Proceedings of the 2014 IEEE Conference on Computational Intelligence and Games","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Renz et al., 2019] J. Renz, X. Ge, M. J. B. Stephenson, and P. Zhang. AI meets Angry Birds. Nature Machine Intelli- gence, 1(7):328-328, 2019.","title":"AI meets Angry Birds","authors":"J Renz, X Ge, M J B Stephenson, P Zhang","year":"2019","venue":"Nature Machine Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Stephenson et al., 2020] Matthew Stephenson, Jochen Renz, and Xiaoyu Ge. The computational complexity of Angry Birds. Artificial Intelligence, 280:103232, 2020.","title":"The computational complexity of Angry Birds","authors":"Matthew Stephenson, Jochen Renz, Xiaoyu Ge","year":"2020","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Stockmeyer and Chandra, 1979] Larry J. Stockmeyer and Ashok K. Chandra. Provably difficult combinatorial games. SIAM Journal on Computing, 8(2):151-174, 1979.","title":"Provably difficult combinatorial games","authors":"Larry J Stockmeyer, Ashok K Chandra","year":"1979","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Viglietta, 2014a] Giovanni Viglietta. Gaming is a hard job, but someone has to do it! Theory of Computing Systems, 54:595-621, 2014.","title":"Giovanni Viglietta. Gaming is a hard job, but someone has to do it!","authors":"Viglietta","year":"2014","venue":"Theory of Computing Systems","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Viglietta, 2014b] Giovanni Viglietta. Lemmings is PSPACE-complete. In Proceedings of the 7th Interna- tional conference on Fun with Algorithms, pages 340-351, 2014.","title":"Giovanni Viglietta. Lemmings is PSPACE-complete","authors":"Viglietta","year":"2014","venue":"Proceedings of the 7th International conference on Fun with Algorithms","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}