NewEvery arXiv paper, its researchers & institutions — mapped.
paper

One-Dimensional Peg Solitaire

arXiv:math/0006067

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.