In this paper we investigate reinforcement learning approaches for the popular computer game Tetris. User-defined reward functions have been applied to T D(0) learning based on ε-greedy strategies in the standard Tetris scenario. The numerical experiments show that reinforcement learning can significantly outperform agents utilizing fixed policies.
CITATION STYLE
Thiam, P., Kessler, V., & Schwenker, F. (2014). A reinforcement learning algorithm to train a tetris playing agent. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8774, pp. 165–170). Springer Verlag. https://doi.org/10.1007/978-3-319-11656-3_15
Mendeley helps you to discover research relevant for your work.