Title
Peg Solitaire on the Windmill and the Double Star Graphs
Document Type
Article
Publication Date
6-1-2012
Description
In a recent work by Beeler and Hoilman, the game of peg solitaire is generalized to arbitrary boards. These boards are treated as graphs in the combinatorial sense. In this paper, we extend this study by considering the windmill and the double star. Simple necessary and sufficient conditions are given for the solvability of each graph. We also discuss an open problem concerning the range of values for which a graph has a terminal state with k pegs.
Citation Information
Beeler, Robert A.; and Hoilman, D. Paul. 2012. Peg Solitaire on the Windmill and the Double Star Graphs. Australasian Journal of Combinatorics. Vol.53 127-134. ISSN: 1034-4942