An Explicit Solution to the Chessboard Pebbling Problem
classification
🧮 math.CO
math.CA
keywords
chessboardconsiderpebblingproblemanalyzedasymptoticchungconfigurations
read the original abstract
We consider the chessboard pebbling problem analyzed by Chung, Graham, Morrison and Odlyzko [3]. We study the number of reachable configurations $G(k)$ and a related double sequence $G(k,m)$. Exact expressions for these are derived, and we then consider various asymptotic limits.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.