2026-07-25T15:29:56Z https://drops.dagstuhl.de/oai

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

Large Peg-Army Maneuvers Gualà, Luciano Leucci, Stefano Natale, Emanuele Tauraso, Roberto Complexity of Games Solitaire Army Despite its long history, the classical game of peg solitaire continues to attract the attention of the scientific community. In this paper, we consider two problems with an algorithmic flavour which are related with this game, namely Solitaire-Reachability and Solitaire-Army. In the first one, we show that deciding whether there is a sequence of jumps which allows a given initial configuration of pegs to reach a target position is NP-complete. Regarding Solitaire-Army, the aim is to successfully deploy an army of pegs in a given region of the board in order to reach a target position. By solving an auxiliary problem with relaxed constraints, we are able to answer some open questions raised by Csakany and Juhasz (Mathematics Magazine, 2000). Schloss Dagstuhl – Leibniz-Zentrum für Informatik Luciano Gualà and Stefano Leucci and Emanuele Natale and Roberto Tauraso 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.18 urn:nbn:de:0030-drops-58709 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.18 eng https://creativecommons.org/licenses/by/3.0/legalcode