1 research outputs found
An Explicit Solution to the Chessboard Pebbling Problem
We consider the chessboard pebbling problem analyzed by Chung, Graham,
Morrison and Odlyzko [3]. We study the number of reachable configurations
and a related double sequence . Exact expressions for these are
derived, and we then consider various asymptotic limits.Comment: 12 pages, 7 reference