Large Peg-Army Maneuvers
Abstract
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 Cs\'ak\'any and Juh\'asz (Mathematics Magazine, 2000). To appreciate the combinatorial beauty of our solutions, we recommend to visit the gallery of animations provided at http://solitairearmy.isnphard.com.
Keywords
Cite
@article{arxiv.1603.00898,
title = {Large Peg-Army Maneuvers},
author = {Luciano Gualà and Stefano Leucci and Emanuele Natale and Roberto Tauraso},
journal= {arXiv preprint arXiv:1603.00898},
year = {2016}
}
Comments
Conference version