  This paper provides a friendly introduction to chip-firing games and graph
gonality. We use graphs coming from the five Platonic solids to illustrate
different tools and techniques for studying these games, including independent
sets, treewidth, scramble number, and Dhar's burning algorithm. In addition to
showcasing some previously known results, we present the first proofs that the
dodecahedron graph has gonality $6$, and that the icosahedron graph has
gonality~$9$.
