Translator Disclaimer
2020 Peg solitaire in three colors on graphs
Tara C. Davis, Alexxis De Lamere, Gustavo Sopena, Roberto C. Soto, Sonali Vyas, Melissa Wong
Involve 13(5): 791-802 (2020). DOI: 10.2140/involve.2020.13.791

Abstract

Peg solitaire is a classical one-person game that has been played in various countries on different types of boards. Numerous studies have focused on the solvability of the games on these traditional boards and more recently on mathematical graphs. In this paper, we go beyond traditional peg solitaire and explore the solvability on graphs with pegs of more than one color and arrive at results that differ from previous works on the subject. This paper focuses on classifying the solvability of peg solitaire in three colors on several different types of common mathematical graphs, including the path, complete bipartite, and star. We also consider the solvability of peg solitaire on the Cartesian products of graphs.

Citation

Download Citation

Tara C. Davis. Alexxis De Lamere. Gustavo Sopena. Roberto C. Soto. Sonali Vyas. Melissa Wong. "Peg solitaire in three colors on graphs." Involve 13 (5) 791 - 802, 2020. https://doi.org/10.2140/involve.2020.13.791

Information

Received: 13 September 2019; Revised: 26 March 2020; Accepted: 6 August 2020; Published: 2020
First available in Project Euclid: 22 December 2020

MathSciNet: MR4190438
Digital Object Identifier: 10.2140/involve.2020.13.791

Subjects:
Primary: 05C57
Secondary: 91A43

Rights: Copyright © 2020 Mathematical Sciences Publishers

JOURNAL ARTICLE
12 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.13 • No. 5 • 2020
MSP
Back to Top