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

Volume 15
Issue 4, 547–726
Issue 3, 367–546
Issue 2, 185–365
Issue 1, 1–184

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

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
About the Journal
Editorial Board
Editors’ Interests
Subscriptions
 
Submission Guidelines
Submission Form
Policies for Authors
Ethics Statement
 
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
Author Index
Coming Soon
 
Other MSP Journals
Peg solitaire on graphs with jumping and merging allowed

Robert A. Beeler and Amanda Kilby

Vol. 15 (2022), No. 3, 433–446
Abstract

Peg solitaire is a one-player board game in which pegs are placed in every hole but one and the player jumps over pegs along rows or columns to remove them. Usually, the goal of the player is to leave only one peg. In a 2011 paper, this game was generalized to graphs. We consider a new variant of peg solitaire on graphs in which pegs can be removed either by jumping them or by merging them together. For this variant, we show that several classes of graphs are solvable. These graphs include stars, caterpillars, trees of diameter 4, trees of diameter 5, and articulated caterpillars. We conclude this paper with several open problems related to this study.

Keywords
games on graphs, peg solitaire, merging peg solitaire
Mathematical Subject Classification
Primary: 05C57
Secondary: 91A43, 91A46
Milestones
Received: 6 May 2021
Revised: 4 October 2021
Accepted: 23 November 2021
Published: 2 December 2022

Communicated by Kenneth S. Berenhaut
Authors
Robert A. Beeler
Department of Mathematics and Statistics
East Tennessee State University
Johnson City, TN
United States
Amanda Kilby
Department of Mathematics and Statistics
East Tennessee State University
Johnson City, TN
United States