Pebbling a Chessboard

DOI10.2307/2975345zbMath0844.05032OpenAlexW4252935560WikidataQ58173419 ScholiaQ58173419MaRDI QIDQ4873026

John A. Morrison, Ronald L. Graham, Andrew M. Odlyzko, Fan R. K. Chung

Publication date: 22 August 1996

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2975345

zbMATH Keywords

enumerationpebblinginfinite chessboardpebble configurationsreachable configuration

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other designs, configurations (05B30) Asymptotic enumeration (05A16) Combinatorial games (91A46)

Related Items

On the number of reachable configurations for the chessboard pebbling problem, Longest alternating subsequences of \(k\)-ary words, An inescapable region for the chessboard pebbling problem on four quadrants, An explicit solution to the chessboard pebbling problem, Geometrical optics and chessboard pebbling, Threshold and complexity results for the cover pebbling game