Towards an algorithmic guide to Spiral Galaxies

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.

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 586; pp. 26 - 39
Main Authors:	Fertin, Guillaume, Jamshidi, Shahrad, Komusiewicz, Christian
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 27.06.2015 Elsevier
Subjects:	Algorithms Computational Complexity Computer Science Corners Fixed-parameter algorithms Game theory NP-hard problems One-player game Spiral galaxies Universe NP-hard problems Fixed-parameter algorithms One-player game one-player game fixed-parameter algorithms
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
Bibliography:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23
ISSN:	0304-3975 1879-2294
DOI:	10.1016/j.tcs.2015.01.051