Large Peg-Army Maneuvers

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 this http URL

[1]  Michal Forisek.  Computational Complexity of Two-Dimensional Platform Games , 2010, FUN.

[2]  Tomomi Matsui,et al.  Integer Programming Based Algorithms for Peg Solitaire Problems , 2000, Computers and Games.

[3]  Martin Aigner.  Moving into the Desert with Fibonacci , 1997 .

[4]  Arie Bialostocki.  An Application of Elementary Group Theory to Central Solitaire , 1998 .

[5]  Graham Cormode,et al.  The Hardness of the Lemmings Game, or "Oh no, more NP-Completeness Proofs" , 2004 .

[6]  Erik D. Demaine,et al.  Games, puzzles and computation , 2009 .

[7]  Bala Ravikumar.  Peg-Solitaire, String Rewriting Systems and Finite Automata , 1997, ISAAC.

[8]  Daniel S. Hirschberg,et al.  The minimum size required of a solitaire army , 2006, ArXiv.

[9]  Giovanni Viglietta.  Gaming Is a Hard Job, But Someone Has to Do It! , 2012, FUN.

[10]  U. Dulleck,et al.  μ-σ Games , 2012, Games.

[11]  Rozália Juhász,et al.  The Solitaire Army Reinspected , 2000 .

[12]  John D. Beasley.  The ins and outs of peg solitaire , 1985 .

[13]  Ryuhei Uehara,et al.  Generalized Hi-Q is NP-complete , 1990 .

[14]  Ian Miguel,et al.  Modelling and solving English Peg Solitaire , 2006, Comput. Oper. Res..

[15]  John D. Beasley.  Solitaire: Recent Developments , 2008, ArXiv.

[16]  David Eppstein,et al.  One-Dimensional Peg Solitaire, and Duotaire , 2000, ArXiv.

[17]  George I. Bell.  A Fresh Look at Peg Solitaire , 2007 .

[18]  Ronald L. Graham,et al.  Pebbling a Chessboard , 1995 .

[19]  Erik D. Demaine,et al.  Classic Nintendo games are (computationally) hard , 2015, Theor. Comput. Sci..

[20]  David Eppstein,et al.  One-Dimensional Peg Solitaire , 2000, ArXiv.

[21]  E. Berlekamp,et al.  Winning Ways for Your Mathematical Plays , 1983 .

[22]  Elwyn R. Berlekamp,et al.  Winning Ways for Your Mathematical Plays, Volume 2 , 2003 .

[23]  Stefano Leucci,et al.  Bejeweled, Candy Crush and other match-three games are (NP-)hard , 2014, 2014 IEEE Conference on Computational Intelligence and Games.

[24]  Robert A. Beeler,et al.  Peg solitaire on graphs , 2011, Discret. Math..

[25]  Peter Ransom,et al.  The Unexpected Hanging And Other Mathematical Diversions , 1992, The Mathematical Gazette.