Abstract
In 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. Normally, the goal of peg solitaire is to minimize the number of pegs remaining at the end of the game. In this paper, we consider the open problem of determining the maximum number of pegs that can remain at the end of the game, under the restriction that we must jump whenever possible. In this paper, we give bounds for this number. We also determine it exactly for several well-known families of graphs. Several open problems regarding this number are also given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
