2026-07-25T14:07:03Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5879 2024-03-06T10:37:05Z ddc:004 open_access

Trainyard is NP-hard Almanza, Matteo Leucci, Stefano Panconesi, Alessandro Complexity of Games Trainyard 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). Schloss Dagstuhl – Leibniz-Zentrum für Informatik Matteo Almanza and Stefano Leucci and Alessandro Panconesi 2016 Is Part Of LIPIcs, Volume 49, 8th International Conference on Fun with Algorithms (FUN 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FUN.2016.2 urn:nbn:de:0030-drops-58796 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.2 eng https://creativecommons.org/licenses/by/3.0/legalcode