Vol. 11, No. 1, 2018

Download this article
Download this article For screen
For printing
Recent Issues

Volume 11, 1 issue

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
Cover Page
Editorial Board
Editors’ Addresses
Editors’ Interests
About the Journal
Scientific Advantages
Submission Guidelines
Submission Form
Ethics Statement
Subscriptions
Editorial Login
Author Index
Coming Soon
Contacts
 
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
Merging peg solitaire on graphs

John Engbers and Ryan Weber

Vol. 11 (2018), No. 1, 53–66
DOI: 10.2140/involve.2018.11.53
Abstract

Peg solitaire has recently been generalized to graphs. Here, pegs start on all but one of the vertices in a graph. A move takes pegs on adjacent vertices x and y, with y also adjacent to a hole on vertex z, and jumps the peg on x over the peg on y to z, removing the peg on y. The goal of the game is to reduce the number of pegs to one.

We introduce the game merging peg solitaire on graphs, where a move takes pegs on vertices x and z (with a hole on y) and merges them to a single peg on y. When can a configuration on a graph, consisting of pegs on all vertices but one, be reduced to a configuration with only a single peg? We give results for a number of graph classes, including stars, paths, cycles, complete bipartite graphs, and some caterpillars.

Keywords
peg solitaire, games on graphs, graph theory
Mathematical Subject Classification 2010
Primary: 05C57
Milestones
Received: 14 February 2016
Revised: 5 August 2016
Accepted: 7 August 2016
Published: 17 July 2017

Communicated by Anant Godbole
Authors
John Engbers
Department of Mathematics, Statistics and Computer Science
Marquette University
Milwaukee, WI 53201
United States
Ryan Weber
Department of Mathematics, Statistics and Computer Science
Marquette University
Milwaukee, WI 53201
United States