One-Dimensional Peg Solitaire
Combinatorics
2007-05-23 v2 Computer Science and Game Theory
Abstract
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.
Cite
@article{arxiv.math/0006067,
title = {One-Dimensional Peg Solitaire},
author = {Cristopher Moore and David Eppstein},
journal= {arXiv preprint arXiv:math/0006067},
year = {2007}
}