CiteSeerX — One-Dimensional Peg Solitaire, and Duotaire

One-Dimensional Peg Solitaire, and Duotaire (2002) [9 citations — 0 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@MISC{Moore02one-dimensionalpeg,
    author = {Cristopher Moore and David Eppstein},
    title = {One-Dimensional Peg Solitaire, and Duotaire},
    year = {2002}
}

Bookmarks

OpenURL

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. We then look

Citations

2870	Introduction to automata theory, languages and computation – Hopcroft, Ullman - 1979
133	The Calculus of Computation – Bradley, Manna - 2007
112	On context-free languages – Parikh - 1966
23	The Ins & Outs of Peg Solitaire – Beasley - 1985
20	Generalized Hi-Q is NP-complete – Uehara, Iwata - 1990
13	Unsolved problems in combinatorial games – Guy, Nowakowski - 2002
7	string rewriting systems and finite automata – Ravikumar, “Peg-solitaire - 1997
3	A programming and problem solving seminar – Chang, Phillips, et al. - 1991
2	Peg Solitaire,” in Mathematical Recreations – Kraitchik - 1942
2	Peg Solitaire,” in The Unexpected Hanging and Other Mathematical Diversions. Simon and – Gardner - 1969
2	Mathematical notions in preliterate societies – Sizer - 1991
2	Peg Solitaire – Kraitchik - 1942
2	Peg Solitaire," in The Unexpected Hanging and Other Mathematical Diversions. Simon and – Gardner - 1969
1	string rewriting systems and automata – Ravikumar, \Peg-solitaire - 1997