On the number of reachable configurations for the chessboard pebbling problem
From MaRDI portal
Publication:2427106
DOI10.1016/j.mcm.2007.02.010zbMath1147.05004OpenAlexW1981419517MaRDI QIDQ2427106
Publication date: 8 May 2008
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2007.02.010
Related Items (2)
An inescapable region for the chessboard pebbling problem on four quadrants ⋮ An explicit solution to the chessboard pebbling problem
Cites Work
This page was built for publication: On the number of reachable configurations for the chessboard pebbling problem