Pebbling a Chessboard

DOI10.2307/2975345MaRDI QIDQ4873026zbMATH OpenOpenAlexWikidataFDO

Authors Fan Chung, Ron Graham, John A. Morrison, Andrew Odlyzko

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

enumerationinfinite chessboardpebble configurationspebblingreachable configuration

Mathematics Subject Classification ID

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

Recommendations

• Geometrical optics and chessboard pebbling
• On the number of reachable configurations for the chessboard pebbling problem
• An explicit solution to the chessboard pebbling problem
• Pebblings

Cited in

(11)

• Threshold and complexity results for the cover pebbling game
• Pebblings
• An inescapable region for the chessboard pebbling problem on four quadrants
• On the number of reachable configurations for the chessboard pebbling problem
• Longest alternating subsequences of \(k\)-ary words
• scientific article; zbMATH DE number 3976363 (Why is no real title available?)
• scientific article; zbMATH DE number 2079096 (Why is no real title available?)
• Disks on a Chessboard
• scientific article; zbMATH DE number 926356 (Why is no real title available?)
• An explicit solution to the chessboard pebbling problem
• Geometrical optics and chessboard pebbling

This page was built for publication: Pebbling a Chessboard

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