首页    期刊浏览 2024年11月06日 星期三
登录注册

文章基本信息

  • 标题:Trainyard is NP-hard
  • 本地全文:下载
  • 作者:Matteo Almanza ; Stefano Leucci ; Alessandro Panconesi
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2016
  • 卷号:49
  • 页码:2:1-2:14
  • DOI:10.4230/LIPIcs.FUN.2016.2
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:Recently, due to the widespread diffusion of smart-phones, mobile puzzle games have experienced a huge increase in their popularity. A successful puzzle has to be both captivating and challenging, and it has been suggested that this features are somehow related to their computational complexity. Indeed, many puzzle games - such as Mah-Jongg, Sokoban, Candy Crush, and 2048, to name a few - are known to be NP-hard. In this paper we consider Trainyard: a popular mobile puzzle game whose goal is to get colored trains from their initial stations to suitable destination stations. We prove that the problem of determining whether there exists a solution to a given Trainyard level is NP. We also provide an implementation of our hardness reduction (see http://trainyard.isnphard.com).
  • 关键词:Complexity of Games; Trainyard
国家哲学社会科学文献中心版权所有