An Explicit Solution to the Chessboard Pebbling Problem

preprint2010arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

An Explicit Solution to the Chessboard Pebbling Problem

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0