Constructing solvable graphs in peg solitaire

MaRDI QIDQ2839649zbMATH OpenFDO

Authors Robert A. Beeler, Aaron D. Gray, D. Paul Hoilman

Publication date 12 July 2013

Published in Bulletin of the Institute of Combinatorics and its Applications (Search for Journal in Brave)

zbMATH Keywords

arbitrary boardscombinatorial gamegame of peg solitaire

Mathematics Subject Classification ID

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

Recommendations

• Peg solitaire on graphs with seven vertices or less
• Peg solitaire on graphs
• Freely solvable graphs in peg solitaire
• Fool's solitaire on graphs
• Making graphs solvable in peg solitaire

Cited in

(20)

• Peg-solitaire, string rewriting systems and finite automata
• Peg solitaire on Cartesian products of graphs
• Merging peg solitaire on graphs
• Freely solvable graphs in peg solitaire
• Modelling and solving English peg solitaire
• Peg solitaire: ``Burn two bridges, build one
• Peg solitaire on graphs with seven vertices or less
• Peg solitaire on the windmill and the double star graphs
• Peg solitaire on banana trees
• Fool's solitaire on graphs
• Peg solitaire on corona products
• Making graphs solvable in peg solitaire
• Path-Stick Solitaire on Graphs
• Packages and purges for peg solitaire on graphs
• scientific article; zbMATH DE number 7324072 (Why is no real title available?)
• Peg solitaire on graphs with large maximum degree
• Peg solitaire on line graphs
• Peg solitaire on graphs
• Pagoda functions for peg solitaire on graphs
• Peg solitaire on graphs -- a survey

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

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