Towards an Algorithmic Guide to Spiral Galaxies

Guillaume Fertin (1) , Shahrad Jamshidi (1) , Christian Komusiewicz (1)

1 LINA - Laboratoire d'Informatique de Nantes Atlantique

In this paper, we are interested in the one-player game Spiral Galaxies, and study it from an algorithmic viewpoint. Spiral Galaxies has been shown to be NP-hard [Friedman, 2002] more than a decade ago, but so far it seems that no one has dared exploring its algorithmic universe. We take this trip and visit some of its corners.

Domaines: Complexité [cs.CC]

Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz. Towards an Algorithmic Guide to Spiral Galaxies. Seventh International Conference on FUN WITH ALGORITHMS (FUN 2014), Jul 2014, Lipari, Italy. pp.171-182, ⟨10.1007/978-3-319-07890-8_15⟩. ⟨hal-01044934⟩