Merging peg solitaire on graphs

DOI10.2140/INVOLVE.2018.11.53MaRDI QIDQ2398941zbMATH OpenOpenAlexFDO

Authors John Engbers, Ryan Weber

Publication date 21 August 2017

Published in Involve (Search for Journal in Brave)

Full work available at URL https://epublications.marquette.edu/mscs_fac/629

zbMATH Keywords

games on graphspeg solitaire

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• Peg solitaire on graphs with jumping and merging allowed
• Constructing solvable graphs in peg solitaire
• Peg solitaire on graphs
• Reversible peg solitaire on graphs
• Peg solitaire: ``Burn two bridges, build one

Cites work

• A Survey of the Game “Lights Out!”
• Fool's solitaire on graphs
• Fool's solitaire on joins and Cartesian products of graphs
• Peg solitaire on graphs
• Reversible peg solitaire on graphs
• Rubbling and optimal rubbling of graphs

Cited in

(8)

• Peg solitaire in three colors on graphs
• Examples of edge critical graphs in peg solitaire
• Peg solitaire on graphs with jumping and merging allowed
• Making graphs solvable in peg solitaire
• Peg solitaire game on Sierpinski graphs
• Packages and purges for peg solitaire on graphs
• Peg duotaire on graphs: jump versus merge
• Peg solitaire on graphs -- a survey

This page was built for publication: Merging peg solitaire on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2398941)