Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

The computational complexity of angry birds and similar physics-simulation games

Thumbnail Image

Date

2017

Authors

Stephenson, Matthew
Renz, Jochen
Ge, Xiaoyu

Journal Title

Journal ISSN

Volume Title

Publisher

AAAI Press

Abstract

This paper presents several proofs for the computational complexity of the popular physics-based puzzle game Angry Birds. By using a combination of different gadgets within this games environment, we can demonstrate that the problem of solving Angry Birds levels is NP-hard. Proof of NP-hardness is by reduction from a known NP-complete problem, in this case 3-SAT. In addition, we are able to show that the original version of Angry Birds is within NP and therefore also NP-complete. These proofs can be extended to other physics-based games with similar mechanics.

Description

Keywords

Citation

URI

http://hdl.handle.net/1885/307664

Collections

ANU Research Publications

Source

Type

Conference paper

Book Title

Entity type

Access Statement

Free Access via publisher website

License Rights

DOI

Restricted until

2099-12-31

Downloads

File
Description
12947-Article Text-16464-1-2-20201228.pdf (881.46 KB)

DSpace software copyright © 2002-2026 LYRASIS