One-Dimensional Peg Solitaire
Cristopher Moore, David Eppstein · arXiv (Cornell University) · 2000
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.