Peg solitaire on graphs

DOI10.1016/j.disc.2011.07.006zbMath1230.05211OpenAlexW1980470279MaRDI QIDQ641194

D. Paul Hoilman, Robert A. Beeler

Publication date: 21 October 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.07.006

zbMATH Keywords

graph theorycombinatorial gamespeg solitaire

Mathematics Subject Classification ID

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

Related Items (12)

Making graphs solvable in peg solitaire ⋮ Peg solitaire game on Sierpinski graphs ⋮ Merging peg solitaire on graphs ⋮ Freely solvable graphs in peg solitaire ⋮ Fool's solitaire on joins and Cartesian products of graphs ⋮ Peg solitaire in three colors on graphs ⋮ Peg solitaire on Cartesian products of graphs ⋮ Unnamed Item ⋮ Examples of edge critical graphs in peg solitaire ⋮ Peg solitaire on graphs with large maximum degree ⋮ Peg solitaire on graphs with jumping and merging allowed ⋮ Reversible peg solitaire on graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solitaire lattices
• Periodicity in one-dimensional peg duotaire
• On the solitaire cone and its relationship to multi-commodity flows.

This page was built for publication: Peg solitaire on graphs