Evolving and discovering tetris gameplay strategies

Citations of this article
Mendeley users who have this article in their library.


This work is motivated by one of the important characteristics of an intelligent system: the ability to automatically discover new knowledge. This work employs an evolutionary technique to search for good solutions and then employs a data mining technique to extract knowledge implicitly encoded in the evolved solutions. In this paper, Genetic Algorithm (GA) is employed to evolve a solution for randomly generated tetromino sequences. 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 were then used to determine players' actions, we directly evolve the gameplay actions. Each chromosome represents a plausible gameplay strategy and its fitness is evaluated by simulating the actual gameplay using gameplay instructions from each chromosome. In each simulation, 13 attributes relevant to the gameplay, i.e., contour patterns and actions of each tetromino, are recorded from the best evolved games. This produces 6583 instances which we then apply Apriori algorithm to extract association patterns from them. The result illustrates that sensible gameplay strategies can be successfully extracted from evolved games even though the GA was not informed about these gameplay strategies. 1877-0509




Phon-Amnuaisuk, S. (2015). Evolving and discovering tetris gameplay strategies. In Procedia Computer Science (Vol. 60, pp. 458–467). Elsevier B.V. https://doi.org/10.1016/j.procs.2015.08.167

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free