Conference Proceeding Article
Gaming expertise is usually accumulated through playing or watching many game instances, and identifying critical moments in these game instances called turning points. Turning point rules (shorten as TPRs) are game patterns that almost always lead to some irreversible outcomes. In this paper, we formulate the notion of irreversible outcome property which can be combined with pattern mining so as to automatically extract TPRs from any given game datasets. We specifically extend the well-known PrefixSpan sequence mining algorithm by incorporating the irreversible outcome property. To show the usefulness of TPRs, we apply them to Tetris, a popular game. We mine TPRs from Tetris games and generate challenging game sequences so as to help training an intelligent Tetris algorithm. Our experiment results show that 1) TPRs can be found from historical game data automatically with reasonable scalability, 2) our TPRs are able to help Tetris algorithm perform better when it is trained with challenging game sequences.
Computer Sciences | Databases and Information Systems | Numerical Analysis and Scientific Computing
Data Management and Analytics
Proceedings of the 2014 SIAM International Conference on Data Mining: April 24-26, Philadelphia, PA
City or Country
GONG, Wei; LIM, Ee Peng; ZHU, Feida; Palakorn, Achananuparp; and LO, David.
On Finding the Point Where There Is No Return: Turning Point Mining on Game Data. (2014). Proceedings of the 2014 SIAM International Conference on Data Mining: April 24-26, Philadelphia, PA. 956-964. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1978
Copyright Owner and License
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.