One-Dimensional Peg Solitaire
<|reference_start|>One-Dimensional Peg Solitaire: 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.<|reference_end|>
@article{moore2000one-dimensional,
    title={One-Dimensional Peg Solitaire},
    author={Cristopher Moore and David Eppstein},
    journal={MSRI Workshop on Combinatorial Games 2000},
    year={2000},
    archivePrefix={arXiv},
    eprint={math/0006067},
    primaryClass={math.CO cs.GT}
}