Large Peg-Army Maneuvers - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Large Peg-Army Maneuvers

Résumé

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).

Dates et versions

hal-02002603 , version 1 (14-02-2019)

Identifiants

Citer

Luciano Gualà, Stefano Leucci, Emanuele Natale, Roberto Tauraso. Large Peg-Army Maneuvers. 8th International Conference on Fun with Algorithms (FUN 2016), Jun 2016, La Maddalena, Maddalena Islands, Italy. ⟨10.4230/LIPIcs.FUN.2016.18⟩. ⟨hal-02002603⟩
26 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More