2000/06/30 by Cristopher Moore, David Eppstein
Mathematics · Computer Science · #math.CO #cs.GT
published as MSRI Workshop on Combinatorial Games 2000
arxiv created 2000/08/04 · arxiv updated 2009/11/30
We solve the problem of one-dimensional peg solitaire. In particular, we show that the set of configurations that can be reduced to a single peg forms a regular language, and that a linear-time algorithm exists for reducing any configuration to the minimum number of pegs.