Abstract
We analyze a new popular video-game called Lumines, which was developed by Sony for the PSP platform. It involves a sequence of bichromatic 2×2 blocks that fall in a grid and must be shifted or rotated by the player before they land. Patterns of monochromatic 2×2 blocks in the terrain are regularly deleted. The primary goal is to contain the terrain within a fixed height and, if possible, clear the grid.
We deal with questions such as: (1) Can the game be played indefinitely? and (2) Can all terrains be eliminated? We examine how answers to these questions depend on the size of the grid and the rate at which blocks are deleted.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Azar, Y., Epstein, L.: On Two-Dimensional Packing. Journal of Algorithms 25(2), 290–310 (1997)
Breukelaar, R., Demaine, E.D., Hohenberger, S., Hoogeboom, H.J., Kosters, W.A., Liben-Nowell, D.: T\(\textsc{etris}\) is Hard, Even to Approximate. International Journal of Computational Geometry and Applications 14, 41–68 (2004)
Brzutowski, J.: Can You Win at T\(\textsc{etris}\)? Master’s thesis, The University of British Columbia (1992)
Burgiel, H.: How to Lose at T\(\textsc{etris}\). Mathematical Gazette 81, 194–200 (1997)
Demaine, E.D.: Playing Games with Algorithms: Algorithmic Combinatorial Game Theory. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 18–32. Springer, Heidelberg (2001)
Demaine, E.D., Hohenberger, S., Liben-Nowell, D.: T\(\textsc{etris}\) is Hard, Even to Approximate. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 351–363. Springer, Heidelberg (2003)
Hoogeboom, H.J., Kosters, W.A.: The Theory of T\(\textsc{etris}\). Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica 9, 14–21 (2005)
Tucker, R.: T\(\textsc{etris}\). Eureka Magazine 51, 34–35 (1992)
Whitelaw, C.: LUMINES: Killing the Fun (2005), http://caseyporn.com/blog/archives/000818.html
Whitelaw, C.: LUMINES: Killing the Fun, Part Two (2005), http://caseyporn.com/blog/archives/000819.html
Wikipedia contributors: LUMINES. Wikipedia, The Free Encyclopedia (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aloupis, G., Cardinal, J., Collette, S., Langerman, S. (2007). LUMINES Strategies. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.(. (eds) Computers and Games. CG 2006. Lecture Notes in Computer Science, vol 4630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75538-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-75538-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75537-1
Online ISBN: 978-3-540-75538-8
eBook Packages: Computer ScienceComputer Science (R0)