论文信息 - Towards an algorithmic guide to Spiral Galaxies

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 [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.

Christian Komusiewicz | Guillaume Fertin | Shahrad Jamshidi

[1] Jack Sklansky,et al. Minimal rectangular partitions of digitized blobs , 1984, Comput. Vis. Graph. Image Process..

[2] Robin Thomas,et al. The Four-Colour Theorem , 1997, J. Comb. Theory, Ser. B.

[3] E. Stetson. Spiral Galaxies Puzzles are NP-complete , 2002 .

[4] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[5] Erik D. Demaine,et al. Games, puzzles and computation , 2009 .

[6] Günter Rote,et al. Minimum-weight triangulation is NP-hard , 2006, JACM.

[7] Fedor V. Fomin,et al. Exact exponential algorithms , 2013, CACM.

[8] Michael R. Fellows,et al. Fundamentals of Parameterized Complexity , 2013 .

[9] Erik D. Demaine,et al. Playing Games with Algorithms: Algorithmic Combinatorial Game Theory , 2001, MFCS.

[10] Ravi Kannan,et al. Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..