Peg Solitaire on Trees With Diameter Four
Document Type
Article
Publication Date
1-1-2015
Description
In a 2011 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 was to classify solvable trees. In this paper, we 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.
Citation Information
Beeler, Robert A.; and Walvoort, Clayton A.. 2015. Peg Solitaire on Trees With Diameter Four. Australasian Journal of Combinatorics. Vol.63(3). 321-332. ISSN: 1034-4942