Peg Solitaire on Trees with Diameter Four

<p>In a paper by Beeler and Hoilman, the traditional game of peg solitaire is generalized to graphs in the combinatorial sense. One of the important open problems in this paper was to classify solvable trees. In this thesis, we will give necessary and sufficient conditions for the solvability for all trees with diameter four. We also give the maximum number of pegs that can be left on such a graph under the restriction that we jump whenever possible.</p>

Name thesis:degree_name

MS (Master of Science)

Level thesis:degree_level

Thesis - unrestricted

Discipline thesis:degree_discipline

Mathematical Sciences

Year dc:date.issued

2013

Author dc:creator

• Walvoort, Clayton A

• graph theory
• peg solitaire
• games on graphs
• combinatorial games
• Discrete Mathematics and Combinatorics

Statement dc:rights

• Copyright by the authors.

Repository record dc:identifier

https://dc.etsu.edu/etd/1113

OAI identifier oai:identifier

oai:dc.etsu.edu:etd-2286