Making graphs solvable in peg solitaire

DOI10.5614/EJGTA.2022.10.2.3MaRDI QIDQ5054035zbMATH OpenOpenAlexFDO

Authors Jan-Hendrik de Wiljes, Martin Kreh

Publication date 29 November 2022

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.5614/ejgta.2022.10.2.3

zbMATH Keywords

double starpeg solitairewindmill

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57)

Recommendations

• Constructing solvable graphs in peg solitaire
• Peg solitaire on graphs
• Freely solvable graphs in peg solitaire
• Peg solitaire game on Sierpinski graphs
• Merging peg solitaire on graphs
• Reversible peg solitaire on graphs
• Peg solitaire on Cartesian products of graphs
• Peg solitaire on graphs with large maximum degree
• Peg solitaire on graphs with jumping and merging allowed
• Peg solitaire in three colors on graphs

Cites work

• 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?)
• Peg solitaire on banana trees
• Peg solitaire on Cartesian products of graphs
• Peg solitaire on caterpillars
• Peg solitaire on graphs
• Peg solitaire on the windmill and the double star graphs
• Reversible peg solitaire on graphs
• Solving triangular peg solitaire

Cited in

(6)

• Modelling and solving English peg solitaire
• Constructing solvable graphs in peg solitaire
• Peg solitaire on banana trees
• scientific article; zbMATH DE number 7324072 (Why is no real title available?)
• Pagoda functions for peg solitaire on graphs
• Peg solitaire on graphs -- a survey

This page was built for publication: Making graphs solvable in peg solitaire

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