One-Dimensional Peg Solitaire
classification
🧮 math.CO
cs.GT
keywords
one-dimensionalsolitairealgorithmconfigurationconfigurationsexistsformslanguage
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.