An Explicit Solution to the Chessboard Pebbling Problem
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.