Towards an Algorithmic Guide to Spiral Galaxies
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.
Unable to display preview. Download preview PDF.
- 2.Downey, R.G., Fellows, M.R.: Fundamentals of parameterized complexity. In: Undergraduate Texts in Computer Science. Springer, Heidelberg (2012)Google Scholar
- 5.Friedman, E.: Spiral galaxies puzzles are NP-complete (2002), http://www2.stetson.edu/~efriedma/papers/spiral.pdf
- 6.Hearn, R.A., Demaine, E.D.: Games, puzzles, and computation. AK Peters, Limited (2009)Google Scholar