The game of blocking pebbles

MaRDI QIDQ3390712zbMATH OpenFDO

Authors

Publication date 25 March 2022

Full work available at URL http://math.colgate.edu/~integers/vb2/vb2.pdf

zbMATH Keywords

combinatorial games

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)

Recommendations

• The game of blocking pebbles
• On Pebbling Graphs by Their Blocks
• The Complexity of Graph Pebbling
• Inapproximability of the standard pebble game and hard to pebble graphs
• Threshold and complexity results for the cover pebbling game

Cites work

• scientific article; zbMATH DE number 5145315 (Why is no real title available?)
• scientific article; zbMATH DE number 5557917 (Why is no real title available?)
• scientific article; zbMATH DE number 1145909 (Why is no real title available?)
• scientific article; zbMATH DE number 2004829 (Why is no real title available?)
• scientific article; zbMATH DE number 1439473 (Why is no real title available?)
• A Nim game played on graphs.
• An introduction to clobber
• Computing strategies for graphical Nim
• Dead ends in misère play: the misère monoid of canonical numbers
• Games and complexes. I: Transformation via ideals
• On the complexity of some two-person perfect-information games
• Pebbling in Hypercubes
• Searching and pebbling

Cited in

(4)

• Generalized impartial two-player pebbling games on \(K_3\) and \(C_4\)
• Characterizing winning positions in the impartial two-player pebbling game on complete graphs
• The game of blocking pebbles
• scientific article; zbMATH DE number 3976363 (Why is no real title available?)

This page was built for publication: The game of blocking pebbles

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