Can I read Complexity of Angry Birds Game AI on EtoBox?

Complexity of Angry Birds Game AI by sixwol55 is a document available to read on EtoBox.

What is Complexity of Angry Birds Game AI about?

This paper analyzes the computational complexity of the game Angry Birds, demonstrating that solving its levels is NP-hard, PSPACE-hard, PSPACE-complete, or EXPTIME-hard depending on the game variant. The authors provide proofs of these complexities through reductions from known computational problems, marking the first instance of a single-player game being proven EXPTIME-hard. The findings suggest implications for other physics-based games with similar mechanics, highlighting the challenges faced by AI in

Author

sixwol55

Language

EN