Peg solitaire on graphs with jumping and merging allowed
For more than three centuries mathematicians are familiar with the Peg solitaire game which is a one-player table game. At the beginning of the last decade, this problem was generalized to graphs. In this game, pegs are placed in every hole but one and the player jumps over pegs along rows or columns to remove them. The aim of the player is to leave only one peg. The authors here consider a new variant of peg solitaire on graphs in which pegs can be removed either by jumping them or by merging them. For this variant, they show that several classes of graphs are solvable. By solvability they mean the following: the game begins with a hole in one vertex and pegs in all others. After a sequence of legal moves, one arrives at a terminal state where no further moves are possible. So the player's aim is to minimize the number of pegs in the terminal state. Starting with a single hole, if one arrives at a terminal state consisting of a single peg, then the graph is said to be solvable. Stimulated by this they seek to consider a variant of peg solitaire in which the player is allowed to use both the traditional jump move as well as the merge move. The aim is to prove the solvability of certain graph families in the new ``jump + merge variant. Note that any graph that is solvable in the jump-only variant or the merge-only variant will still be solvable in the jump+merge variant. For instance, the path on \(n\) vertices is shown to be solvable using only merge moves in. The authors establish here that there are graphs that are not solvable in either variant and that are solvable when both jumping and merging are allowed. These graphs include stars, caterpillars, trees of diameter 4, trees of diameter 5, and articulated caterpillars. The authors also give several open problems related to this for other researchers working in this area.
- An introduction to peg duotaire on graphs
- Extremal results for Peg solitaire on graphs
- Fool's solitaire on graphs
- Fool's solitaire on joins and Cartesian products of graphs
- scientific article; zbMATH DE number 6509361 (Why is no real title available?)
- scientific article; zbMATH DE number 1933246 (Why is no real title available?)
- scientific article; zbMATH DE number 1889828 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 7324072 (Why is no real title available?)
- Merging peg solitaire on graphs
- Packages and purges for peg solitaire on graphs
- Peg solitaire game on Sierpinski graphs
- Peg solitaire in three colors on graphs
- Peg solitaire on banana trees
- Peg solitaire on Cartesian products of graphs
- Peg solitaire on caterpillars
- Peg solitaire on graphs
- Peg solitaire on graphs with seven vertices or less
- Peg solitaire on the windmill and the double star graphs
- Peg solitaire: ``Burn two bridges, build one
- Reversible peg solitaire on graphs
- Peg solitaire in three colors on graphs
- Examples of edge critical graphs in peg solitaire
- Reversible peg solitaire on graphs
- Merging peg solitaire on graphs
- Peg solitaire: ``Burn two bridges, build one
- Peg solitaire on caterpillars
- An introduction to peg duotaire on graphs
- Making graphs solvable in peg solitaire
- Path-Stick Solitaire on Graphs
- Solitaire army and related games
- scientific article; zbMATH DE number 7324072 (Why is no real title available?)
- Peg duotaire on graphs: jump versus merge
This page was built for publication: Peg solitaire on graphs with jumping and merging allowed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109085)
