Mathematics – Combinatorics
Scientific paper
2000-06-08
MSRI Workshop on Combinatorial Games 2000
Mathematics
Combinatorics
Scientific paper
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.
Eppstein David
Moore Cristopher
No associations
LandOfFree
One-Dimensional Peg Solitaire does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with One-Dimensional Peg Solitaire, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and One-Dimensional Peg Solitaire will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-499060