One-Dimensional Peg Solitaire, and Duotaire
| dc.creator | Moore, Cristopher | |
| dc.creator | Eppstein, David | |
| dc.date | 2000-08-22 | |
| dc.date.accessioned | 2026-07-25T22:52:26Z | |
| dc.description | 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 at the impartial two-player game, proposed by Ravikumar, where two players take turns making peg moves, and whichever player is left without a move loses. We calculate some simple nim-values and discuss when the game separates into a disjunctive sum of smaller games. In the version where a series of hops can be made in a single move, we show that neither the P-positions nor the N-positions (i.e. wins for the previous or next player) are described by a regular or context-free language. | |
| dc.description | Partlt presented at the 2000 MSRI Workshop on Combinatorial Games | |
| dc.identifier | https://arxiv.org/abs/math/0008172 | |
| dc.identifier | http://arxiv.org/abs/math/0008172 | |
| dc.identifier | More Games of No Chance, MSRI Publications 42, 2002, pp. 341-350 | |
| dc.identifier.uri | https://dspace.dare.co.zw/handle/123456789/93326 | |
| dc.subject | Combinatorics | |
| dc.subject | Computer Science and Game Theory | |
| dc.title | One-Dimensional Peg Solitaire, and Duotaire | |
| dc.type | text |