An explicit solution to the chessboard pebbling problem

作者：Zhen Qiang^*; Knessl Charles

来源：Journal of Difference Equations and Applications, 2013, 19(2): 201-208.

DOI：10.1080/10236198.2011.631737

• chessboard pebbling
• reachable configurations
• asymptotics
• difference equation

We consider the chessboard pebbling problem analysed by Chung et al. [Pebbling a chessboard, Am. Math. Mon. 102 (1995), pp. 113-123]. We study the number of reachable configurations G(k) and a related double sequence G(k, m). The analysis involves solving a difference equation satisfied by G(k, m). Exact expressions for these are derived, and we then consider various asymptotic limits.

• 出版日期2013-2