Abstract
Genetic Algorithm (GA) is employed to evolve a solution for any given tetromino sequence. In contrast to previous works in this area where an evolutionary strategy was employed to evolve weights (i.e., preferences) of predefined evaluation functions which then were used to determine players’ actions, we directly evolve the actions. Each chromosome represents a plausible gameplay strategy and its fitness is evaluated by simulating the game and rating the gameplay quality using two fitness evaluation approaches: evaluating the whole board at once and evaluating local parts of the board in which they will be expanded to the whole board as the evolution progresses. We compare the results of these two evaluation tactics and also compare the evolved gameplay with actual human gameplay.
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
Perl, J.: Heuristics: Intelligence Search Strategies for Computer Problem Solving. Addoson-Wesley (1984)
Goldberg, D.: Genetic algorithms in search, optimization, and machine learning. Addoson-Wesley (1989)
Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micromachine and Human Science, Nagoya, Japan, pp. 39–43 (1995)
Böhm, N., Kókai, G., Mandl, S.: An Evolutionary Approach to Tetris. In: Proceedings of the Sixth Metaheuristics International Conference (MIC 2005), Vienna, Austria, pp. 1–6 (2005)
Boumaza, A.: On the evolution of artificial Tetris players. In: Proceedings of the IEEE Symposium on Computational Intelligence and Games (CIG 2009), pp. 387–393 (2009)
Demaine, E.D., Hohenberger, S., Liben-Nowell, D.: Tetris is hard, even to approximate. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 351–363. Springer, Heidelberg (2003)
Thiery, C., Scherrer, B.: Building controllers for Tetris. International Computer Game Association Journal 32, 3–11 (2009)
Carr, D.: Adapting reinforcement learning to Tetris BSc (Honours) Thesis, Rhodes University (2005)
Langenhoven, L., van Heerden, W.S., Engelbrecht, A.P.: Swarm tetris: Applying particle swarm optimisation to Tetris. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010), Barcelona, pp. 1–8 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Phon-Amnuaisuk, S. (2014). GA-Tetris Bot: Evolving a Better Tetris Gameplay Using Adaptive Evaluation Scheme. In: Loo, C.K., Yap, K.S., Wong, K.W., Beng Jin, A.T., Huang, K. (eds) Neural Information Processing. ICONIP 2014. Lecture Notes in Computer Science, vol 8836. Springer, Cham. https://doi.org/10.1007/978-3-319-12643-2_70
Download citation
DOI: https://doi.org/10.1007/978-3-319-12643-2_70
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12642-5
Online ISBN: 978-3-319-12643-2
eBook Packages: Computer ScienceComputer Science (R0)