An inescapable region for the chessboard pebbling problem on four quadrants

DOI10.1016/J.ENDM.2018.11.009zbMATH Open1460.05129OpenAlexW2905102674WikidataQ128812420 ScholiaQ128812420MaRDI QIDQ1739928FDOQ1739928

Authors: Nicholas Korpelainen, Mathew Stubley 

Publication date: 29 April 2019

Full work available at URL: https://doi.org/10.1016/j.endm.2018.11.009

Recommendations

• An explicit solution to the chessboard pebbling problem
• Pebblings
• scientific article; zbMATH DE number 1802689
• Pebbling a Chessboard
• scientific article; zbMATH DE number 2121613

zbMATH Keywords

pebblingpebbling numbergraph pebblingchessboardsgames on grids

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Pebbling a Chessboard
• Pebblings
• On the number of reachable configurations for the chessboard pebbling problem
• An explicit solution to the chessboard pebbling problem

Cited In (1)

• An alternative efficient chessboard representation based on 4-bit piece coding

This page was built for publication: An inescapable region for the chessboard pebbling problem on four quadrants

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