An Explicit Solution to the Chessboard Pebbling Problem

Qiang Zhen; Charles Knessl

An Explicit Solution to the Chessboard Pebbling Problem

Combinatorics 2010-09-30 v1 Classical Analysis and ODEs

Authors: Qiang Zhen , Charles Knessl

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.

Keywords

combinatorial games painlevé equations

Cite

@article{arxiv.1009.5731,
  title  = {An Explicit Solution to the Chessboard Pebbling Problem},
  author = {Qiang Zhen and Charles Knessl},
  journal= {arXiv preprint arXiv:1009.5731},
  year   = {2010}
}

Comments

12 pages, 7 references

Related papers

View all related →