Fool's solitaire on graphs

DOI10.2140/INVOLVE.2012.5.473MaRDI QIDQ365932zbMATH OpenOpenAlexFDO

Authors Robert A. Beeler, Tony K. Rodriguez

Publication date 10 September 2013

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/involve.2012.5.473

zbMATH Keywords

games on graphscombinatorial gamespeg solitaire

Mathematics Subject Classification ID

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

Recommendations

• Fool's solitaire on joins and Cartesian products of graphs
• Constructing solvable graphs in peg solitaire
• Peg solitaire on graphs with seven vertices or less
• Extremal results for Peg solitaire on graphs
• Peg solitaire on graphs

Cited in

(23)

• Reversible peg solitaire on graphs
• Constructing solvable graphs in peg solitaire
• Fagan's Construction, Strange Roots, and Tchoukaillon Solitaire
• Path-Stick Solitaire on Graphs
• The complexity of solitaire
• Pagoda functions for peg solitaire on graphs
• Peg solitaire in three colors on graphs
• Peg solitaire on Cartesian products of graphs
• Examples of edge critical graphs in peg solitaire
• Peg solitaire on graphs -- a survey
• Merging peg solitaire on graphs
• Making graphs solvable in peg solitaire
• Peg solitaire on graphs with jumping and merging allowed
• Peg solitaire on graphs with seven vertices or less
• Pegging numbers for various tree graphs.
• Extremal results for Peg solitaire on graphs
• Peg solitaire game on Sierpinski graphs
• An introduction to peg duotaire on graphs
• Peg solitaire on line graphs
• Fool's solitaire on joins and Cartesian products of graphs
• Impartial solitaire clobber played on powers of paths
• Morpion solitaire 5D: a new upper bound of 121 on the maximum score
• Solitaire lattices

This page was built for publication: Fool's solitaire on graphs

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