Peg solitaire in three colors on graphs
| Autor: | Tara C. Davis, Melissa Wong, Roberto C. Soto, Alexxis De Lamere, Gustavo Sopena, Sonali Vyas |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Computer Science::Computer Science and Game Theory
Solitaire Cryptographic Algorithm combinatorial games General Mathematics games on graphs peg solitaire Combinatorial game theory Star (graph theory) Cartesian product Combinatorics symbols.namesake TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Computer Science::Discrete Mathematics Path (graph theory) 91A43 symbols Bipartite graph Astrophysics::Solar and Stellar Astrophysics 05C57 MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
| Zdroj: | Involve 13, no. 5 (2020), 791-802 |
| ISSN: | 1944-4184 1944-4176 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|