2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/59381We 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.CombinatoricsComputer Science and Game Theorytext