Abstract
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. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Fertin, G., Jamshidi, S., & Komusiewicz, C. (2014). Towards an algorithmic guide to spiral galaxies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8496 LNCS, pp. 171–182). Springer Verlag. https://doi.org/10.1007/978-3-319-07890-8_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
