A reinforcement learning algorithm to train a tetris playing agent

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

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

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

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