论文信息 - One-Dimensional Peg Solitaire

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.

David Eppstein | Cristopher Moore

[1] Richard J. Nowakowski,et al. Games of No Chance 3: Surveys , 1998 .

[2] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[3] Peter Ransom,et al. The Unexpected Hanging And Other Mathematical Diversions , 1992, The Mathematical Gazette.

[4] John D. Beasley. The ins and outs of peg solitaire , 1985 .

[5] Ryuhei Uehara,et al. Generalized Hi-Q is NP-complete , 1990 .

[6] Jeffrey D. Ullman,et al. A programming and problem solving seminar. , 1991 .

[7] John McCarthy,et al. Mathematical Theory of Computation , 1991 .