Towards an Algorithmic Guide to Spiral Galaxies
Résumé
We study the one-player game Spiral Galaxies 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.
Domaines
Complexité [cs.CC]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...