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.
PDF Access Denied
We have not been able to recognize your IP address
98.84.18.52
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.