One-Dimensional Peg Solitaire

Simple item page
dc.creatorMoore, Cristopher
dc.creatorEppstein, David
dc.date2000-06-08
dc.date2000-08-04
dc.date.accessioned2026-07-07T04:35:48Z
dc.date.available2026-07-07T04:35:48Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/0006067
dc.identifierhttp://arxiv.org/abs/math/0006067
dc.identifierMSRI Workshop on Combinatorial Games 2000
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/59381
dc.subjectCombinatorics
dc.subjectComputer Science and Game Theory
dc.titleOne-Dimensional Peg Solitaire
dc.typetext

Files

Collections

arXiv