An Explicit Solution to the Chessboard Pebbling Problem

Details An Explicit Solution to the Chessboard Pebbling Problem An Explicit Solution to the Chessboard Pebbling Problem

2010-09-29

arxiv.org/abs/1009.5731v1

Mathematics

Combinatorics

12 pages, 7 references

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An Explicit Solution to the Chessboard Pebbling Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Explicit Solution to the Chessboard Pebbling Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Explicit Solution to the Chessboard Pebbling Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-522307