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.

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 586; s. 26 - 39
Hlavní autoři: Fertin, Guillaume, Jamshidi, Shahrad, Komusiewicz, Christian
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 27.06.2015
Elsevier
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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