Peg solitaire and Conway's soldiers on infinite graphs

TL;DR

This paper extends the analysis of peg solitaire and Conway's soldiers to infinite graphs, proving impossibility results and generalizing the game to countable graphs beyond finite structures.

Contribution

It introduces a new impossibility result for peg solitaire on infinite graphs and generalizes the game to countable graphs, expanding the theoretical framework.

Findings

Proves an impossibility property for peg solitaire on infinite graphs.

Generalizes peg solitaire to countable infinite graphs.

Extends Conway's soldiers concept to graph structures.

Abstract

Peg solitaire is classically a one-player game played on a grid board containing pegs. The goal of the game is to have a single peg remaining on the board by sequentially jumping with a peg over an adjacent peg onto an empty cell while eliminating the jumped peg. Conway's soldiers is a related game played on $\mathbb{Z}^2$ with pegs initially located on the half-space $y \le 0$. The goal is to bring a peg as far up as possible on the board using peg solitaire jumps. Conway showed that bringing a peg to the line $y = 5$ is impossible with finitely many jumps. Applying Conway's approach, we prove an analogous impossibility property on graphs. In addition, we generalize peg solitaire on finite graphs as introduced by Beeler and Hoilman (2011) to an infinite game played on countable graphs.