Degree Name

MS (Master of Science)

Program

Mathematical Sciences

Date of Award

12-2013

Committee Chair or Co-Chairs

Robert A. Beeler

Committee Members

Anant P. Godbole, Teresa W. Haynes, Debra Knisley

Abstract

In a 2011 paper by Beeler and Hoilman, the game of peg solitaire is generalized to arbitrary boards. These boards are treated as graphs in the combinatorial sense. An open problem from that paper is to determine the minimum number of edges necessary for a graph with a fixed number of vertices to be solvable. This thesis provides new bounds on this number. It also provides necessary and sufficient conditions for two families of graphs to be solvable, along with criticality results, and the maximum number of pegs that can be left in each of the two graph families.

Document Type

Thesis - Open Access

Copyright

Copyright by the authors.

Share

COinS