PDF] The complexity of speedrunning video games

Por um escritor misterioso

Descrição

This paper shows that optimizing mechanics such as damage boosting or routing is in fact a profound algorithmic problem, as they lead to novel generalizations of the well-known NP-hard knapsack and feedback arc set problems. Speedrunning is a popular activity in which the goal is to finish a video game as fast as possible. Players around the world spend hours each day on live stream, perfecting their skills to achieve a world record in well-known games such as Super Mario Bros, Castlevania or Mega Man. But human execution is not the only factor in a successful speed run. Some common techniques such as damage boosting or routing require careful planning to optimize time gains. In this paper, we show that optimizing these mechanics is in fact a profound algorithmic problem, as they lead to novel generalizations of the well-known NP-hard knapsack and feedback arc set problems. We show that the problem of finding the optimal damage boosting locations in a game admits an FPTAS and is FPT in k + r, the number k of enemy types in the game and r the number of health refill locations. However, if the player is allowed to lose a life to regain health, the problem becomes hard to approximate within a factor 1/2 but admits a (1/2− )-approximation with two lives. Damage boosting can also be solved in pseudo-polynomial time. As for routing, we show various hardness results, including W [2]-hardness in the time lost in a game, even on bounded treewidth stage graphs. On the positive side, we exhibit an FPT algorithm for stage graphs of bounded treewidth and bounded in-degree. 2012 ACM Subject Classification Theory of computation → Design and analysis of algorithms, Theory of computation → Approximation algorithms analysis, Theory of computation → Parameterized complexity and exact algorithms
PDF] The complexity of speedrunning video games
Would You Kindly?” The Interdisciplinary Trajectories of Video Game Agency « G, A, M
PDF] The complexity of speedrunning video games
Arkham Horror The Card Game, Mystery Cooperative Card Games for Adults and Teens Ages 14 and up, 1-2 Players, Average Playtime 1-2 Hours
PDF] The complexity of speedrunning video games
Green Hill Zone: Most Up-to-Date Encyclopedia, News & Reviews
PDF] The complexity of speedrunning video games
PDF) Simplifying the complexity of assessing physical performance in professional Australian football
PDF] The complexity of speedrunning video games
Is speedrunning (video games) a huge waste of time? - Quora
PDF] The complexity of speedrunning video games
PDF) Video Games Caught Up in History. Accessibility, Teleological Distortion, and Other Methodological Issues
PDF] The complexity of speedrunning video games
Green Hill Zone - Wikipedia
PDF] The complexity of speedrunning video games
Play it faster, play it weirder: how speedrunning pushes video games beyond their limits, Games
PDF] The complexity of speedrunning video games
View of From NES-4021 to moSMB3.wmv: Speedrunning the Serial Interface
PDF] The complexity of speedrunning video games
183 PDF, PDF, Video Game Development
de por adulto (o preço varia de acordo com o tamanho do grupo)