Fool's solitaire on graphs
From MaRDI portal
Publication:365932
DOI10.2140/INVOLVE.2012.5.473zbMATH Open1271.05062OpenAlexW2037687530MaRDI QIDQ365932FDOQ365932
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
Recommendations
Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Combinatorial games (91A46)
Cited In (23)
- Peg solitaire on Cartesian products of graphs
- Peg solitaire on graphs with jumping and merging allowed
- Peg solitaire on line graphs
- Peg solitaire on graphs with seven vertices or less
- Constructing solvable graphs in peg solitaire
- Fagan's Construction, Strange Roots, and Tchoukaillon Solitaire
- Pagoda functions for peg solitaire on graphs
- Peg solitaire in three colors on graphs
- Reversible peg solitaire on graphs
- Merging peg solitaire on graphs
- Path-Stick Solitaire on Graphs
- The complexity of solitaire
- Peg solitaire game on Sierpinski graphs
- Fool's solitaire on joins and Cartesian products of graphs
- Peg solitaire on graphs -- a survey
- Pegging numbers for various tree graphs.
- Extremal results for Peg solitaire on graphs
- An introduction to peg duotaire on graphs
- Morpion solitaire 5D: a new upper bound of 121 on the maximum score
- Examples of edge critical graphs in peg solitaire
- Impartial solitaire clobber played on powers of paths
- Solitaire lattices
- Making graphs solvable in peg solitaire
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)