论文信息 - An Inescapable Region for the Chessboard Pebbling Problem on Four Quadrants

An Inescapable Region for the Chessboard Pebbling Problem on Four Quadrants

Abstract This is a generalisation of a chessboard pebbling problem (and the associated escapability-result) from one quadrant of an infinite integer lattice (as discussed by Chung et. al. in 1995 [Chung, F., Graham, R., Morrison, J. and Odlyzko, A., Pebbling a Chessboard, The American Mathematical Monthly, 102(2), 1995, p. 113.]) to four quadrants.

Nicholas Korpelainen | Mathew Stubley

[1] C. Knessl,et al. An explicit solution to the chessboard pebbling problem , 2010, 1009.5731.

[2] Ronald L. Graham,et al. Pebbling a Chessboard , 1995 .

[3] Charles Knessl. On the number of reachable configurations for the chessboard pebbling problem , 2008, Math. Comput. Model..