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.
"Peg solitaire in three colors on graphs." Involve 13 (5) 791 - 802, 2020. https://doi.org/10.2140/involve.2020.13.791