Abstract
The peg solitaire game is generalized to arbitrary boards by Beeler and Hoilman. These boards are considered as connected graphs in the combinatorial sense. In this study, peg solitaire game on Sierpinski graphs is considered, and it is proved that Sierpinski graphs are freely solvable, it means that, it can be solved from any starting position. Furthermore, we prove that the final peg can be left in any vertex.
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 callSimilar Papers
More From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: 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.
