Building controllers for tetris

ICGA Journal

Volumn 32, Issue 1, 2009, Pages 3-11

  Thiery, Christophe ^a   Scherrer, Bruno ^b  

^a LORIA   (France)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

REINFORCEMENT LEARNING;

FEATURE WEIGHT; PERFORMANCE MEASURE; VIDEO GAME; WEIGHT OPTIMIZATION;

CONTROLLERS;

EID: 70350140182     PISSN: 13896911     EISSN: None     Source Type: Journal    
DOI: 10.3233/ICG-2009-32102     Document Type: Article

References (19)

1. Bellman, R. E. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ.
2. Bertsekas, D. and Tsitsiklis, J. (1996). Neurodynamic Programming. Athena Scientific.
3. Billingsley, P. (1995). Probability and measure. John Wiley & Sons, New York, N.Y., 3rd edition.
4. Boer, P. de, Kroese, D., Mannor, S., and Rubinstein, R. (2004). A tutorial on the cross-entropy method. Annals of Operations Research, Vol.1, No. 134, pp. 19-67.
5. Böhm, N., Kókai, G., and Mandl, S. (2005). An Evolutionary Approach to Tetris. The Sixth Metaheuristics International Conference (MIC2005).
6. Burgiel, H. (1997). How to Lose at Tetris. Mathematical Gazette, Vol.81, pp. 194-200.
7. Carr, D. (2005). Applying reinforcement learning to Tetris. Technical report, Computer Science department of Rhodes University.
8. Demaine, E. D., Hohenberger, S., and Liben-Nowell, D. (2003). Tetris is hard, even to approximate. Proc. 9th International Computing and Combinatorics Conference (COCOON 2003), pp. 351-363.
9. Fahey, C. P. (2003). Tetris AI, Computer plays Tetris. http: //colinf ahey.com/tetris/tetris-en.html.
10. Farias, V. and Roy, B. van (2006). Tetris: A study of randomized constraint sampling. Springer-Verlag.
11. Kakade, S. (2001). A natural policy gradient. Advances in Neural Information Processing Systems (NIPS 14), pp. 1531-1538.
12. Lagoudakis, M. G., Parr, R., and Littman, M. L. (2002). Least-squares methods in reinforcement learning for control. SETN '02: Proceedings of the Second Hellenic Conference on AI, pp. 249-260, Springer-Verlag, London, UK.
13. Llima, R. E. (2005). Xtris readme. http://www.iagora.com/~espel/xtris/ README.
14. Puterman, M. (1994). Markov Decision Processes. Wiley, New York.
15. Ramon, J. and Driessens, K. (2004). On the numeric stability of gaussian processes regression for relational reinforcement learning. ICML-2004 Workshop on Relational Reinforcement Learning, pp. 10-14.
16. Sutton, R. and Barto, A. (1998). Reinforcement Learning, An introduction. BradFord Book. The MIT Press.
17. Szita, I. and Loyincz, A. (2006). Learning Tetris Using the Noisy Cross-Entropy Method. Neural Computation, Vol.18, No.12, pp. 2936-2941.
18. Thiery, C. and Scherrer, B. (2009). Construction d'un joueur artificiel pour Tetris. Revue d'Intelligence Artifi-cielle, Vol.23, pp. 387-407.
19. Tsitsiklis, J. N. and Roy, B. van (1996). Feature-Based Methods for Large Scale Dynamic Programming. Machine Learning, Vol.22, pp. 59-94.