The game of blocking pebbles

zbMATH Open1492.91063MaRDI QIDQ3390712FDOQ3390712

Authors:

Publication date: 25 March 2022

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

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

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)

Cites Work

• Searching and pebbling
• Title not available (Why is that?)
• Pebbling in Hypercubes
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of some two-person perfect-information games
• Title not available (Why is that?)
• A Nim game played on graphs.
• Dead ends in misère play: the misère monoid of canonical numbers
• Title not available (Why is that?)
• An introduction to clobber
• Computing strategies for graphical Nim
• Games and complexes. I: Transformation via ideals

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
• Title not available (Why is that?)

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)