Classifying Celeste as NP Complete-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Classifying Celeste as NP Complete

Published:2022-11-12 Issue: Volume: Page:
ISSN:
Container-title:Computer Science & Technology Trends
language:
Short-container-title:

Author:

Ahmed Zeeshan,Chaudhuri Alapan,Grover Kunwar,Rao Ashwin,Garg Kushagra,Malhotra Pulak

Abstract

We analyze the computational complexity of the video game "CELESTE" and prove that solving a generalized level in it is NP-Complete. Further, we also show how, upon introducing a small change in the game mechanics (adding a new game entity), we can make it PSPACE-complete.

Publisher

Academy and Industry Research Collaboration Center (AIRCC)

Reference8 articles.

1. [1] Wikipedia contributors. Celeste (video game) - Wikipedia, the free encyclopaedia, accessed 2022.

2. [2] S. Arora and B. Barak, Computational Complexity: A Modern Approach, Cambridge University Press, 2006.

3. [3] Giovanni Viglietta, Gaming is a hard job, but someone has to do it!, Theory of Computing Systems, v. 54, p. 595-621, 2014.

4. [4] Greg Aloupis et. al., Classic nintendo games are (computationally) hard, Theoretical Computer Science, v. 586, p. 135-160, 2015.

5. [5] Erik D. Demaine et. al., Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard, Innovations in Theoretical Computer Science Conference, 2020.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP