Article ID Journal Published Year Pages File Type
435861 Theoretical Computer Science 2015 14 Pages PDF
Abstract

We study the one-player game Spiral Galaxies from an algorithmic viewpoint. Spiral Galaxies has been shown to be NP-hard [6] 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.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Towards an algorithmic guide to Spiral Galaxies
Authors
, , ,