Trainyard is NP-Hard

Abstract

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 [5]. Indeed, many puzzle games – such as Mah-Jongg, Sokoban, Candy Crush, and 2048, to name a few – are known to be NP-hard [3, 4, 7, 10]. 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-hard. We also provide an implementation of our hardness reduction.1 1998 ACM Subject Classification F.2.m Miscellaneous

DOI: 10.4230/LIPIcs.FUN.2016.2

Extracted Key Phrases

13 Figures and Tables

Cite this paper

@inproceedings{Almanza2016TrainyardIN, title={Trainyard is NP-Hard}, author={Matteo Almanza and Stefano Leucci and Alessandro Panconesi}, booktitle={FUN}, year={2016} }