An explicit solution to the chessboard pebbling problem

DOI10.1080/10236198.2011.631737MaRDI QIDQ4908680zbMATH OpenOpenAlexFDO

Authors Qiang Zhen, Charles Knessl

Publication date 6 March 2013

Published in Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1009.5731

zbMATH Keywords

asymptoticsdifference equationchessboard pebblingreachable configurations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other designs, configurations (05B30)

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.

Recommendations

• On the number of reachable configurations for the chessboard pebbling problem
• Pebbling a Chessboard
• The cover pebbling number of graphs
• Geometrical optics and chessboard pebbling
• Pebblings

Cites work

• Disks on a Chessboard
• Geometrical optics and chessboard pebbling
• On the number of reachable configurations for the chessboard pebbling problem
• Pebbling a Chessboard

Cited in

(7)

• An inescapable region for the chessboard pebbling problem on four quadrants
• On the number of reachable configurations for the chessboard pebbling problem
• An interactive solution to the n x n mutilated checkerboard problem
• Geometrical optics and chessboard pebbling
• A tight bound for black and white pebbles on the pyramid
• An alternative efficient chessboard representation based on 4-bit piece coding
• A Natural Formalization of the Mutilated Checkerboard Problem in Naproche

This page was built for publication: An explicit solution to the chessboard pebbling problem

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