Affiliation:
1. Department of Computer and Network Engineering, The University of Electro-Communications, Chofu, Tokyo, Japan
Abstract
PuyoPuyo is one of the Tetris-type games, which is dealt with as a single-player game in this paper. The player has a winning strategy if the player can keep playing the game infinitely on a gameboard of a constant height. In this paper, we consider how lookahead of input pieces affects the existence of winning strategies in PuyoPuyo, and show conditions that the player cannot win even with lookahead. First, we show the number of colors sufficient to make the player lose on the gameboard of width w when the number of lookahead pieces is m. Next, we show that ten and twenty-six colors are sufficient to make the player lose on the gameboards of width two and three, respectively, no matter how large the number of lookahead pieces is.
Subject
Computer Graphics and Computer-Aided Design,Human-Computer Interaction,Computational Mechanics,Computer Science (miscellaneous)
Reference13 articles.
1. Aloupis, G., Cardinal, J., Collette, S. & Langerman, S. (2007). Lumines strategies. In Proc. 5th International Conference on Computers and Games. LNCS (Vol. 4630, pp. 190–199). Springer.
2. Asif, S., Demaine, E.D., Lynch, J. & Singhal, M. (2019). Tetris is NP-hard even with O(1) columns. In The 22nd Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG3) (pp. 37–38).
3. Combinatorial analysis of Tetris-like games;Baccherini;Discrete Mathematics,2007
4. Tetris is hard, even to approximate;Breukelaar;International Journal of Computational Geometry & Applications,2004
5. How to lose at Tetris;Burgiel;Mathematical Gazette,1997