Computational Complexity of Two-Dimensional Platform Games

DOI10.1007/978-3-642-13122-6_22zbMath1327.68132OpenAlexW1501441673MaRDI QIDQ3563862

Michal Forišek

Publication date: 1 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13122-6_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (12)

Games, Puzzles and Treewidth ⋮ The complexity of speedrunning video games ⋮ The Computational Complexity of Portal and Other 3D Video Games ⋮ Restricted Power - Computational Complexity Results for Strategic Defense Games ⋮ PSPACE-Completeness of Bloxorz and of Games with 2-Buttons ⋮ Mario Kart Is Hard ⋮ Generalized Pete's Pike is PSPACE-complete ⋮ Unnamed Item ⋮ Gaming is a hard job, but someone has to do it! ⋮ The computational complexity of Angry Birds ⋮ Lemmings is PSPACE-complete ⋮ Classic Nintendo games are (computationally) hard

This page was built for publication: Computational Complexity of Two-Dimensional Platform Games