On the evolution of articial Tetris players

[1]  John N. Tsitsiklis,et al.  Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.

[2]  Heidi Burgiel,et al.  How to lose at Tetris , 1997, The Mathematical Gazette.

[3]  Nikolaus Hansen,et al.  Completely Derandomized Self-Adaptation in Evolution Strategies , 2001, Evolutionary Computation.

[4]  Michail G. Lagoudakis,et al.  Least-Squares Methods in Reinforcement Learning for Control , 2002, SETN.

[5]  Benjamin Van Roy,et al.  Tetris: A Study of Randomized Constraint Sampling , 2006 .

[6]  Thomas Bäck,et al.  Evolutionary Algorithms in Theory and Practice , 1996 .

[7]  Eric V. Siegel,et al.  Genetically optimizing the speed of programs evolved to play tetris , 1996 .

[8]  András Lörincz,et al.  Learning Tetris Using the Noisy Cross-Entropy Method , 2006, Neural Computation.

[9]  Erik D. Demaine,et al.  Tetris is Hard, Even to Approximate , 2003, COCOON.

[10]  Niko Bohm,et al.  An Evolutionary Approach to Tetris , 2005 .

[11]  Hans-Paul Schwefel,et al.  Evolution strategies – A comprehensive introduction , 2002, Natural Computing.

[12]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[13]  Shie Mannor,et al.  A Tutorial on the Cross-Entropy Method , 2005, Ann. Oper. Res..

[14]  Nikolaus Hansen,et al.  Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[15]  Bruno Scherrer,et al.  Construction d'un joueur artificiel pour Tetris , 2009, Rev. d'Intelligence Artif..

[16]  Jan Ramon,et al.  On the numeric stability of Gaussian processes regression for relational reinforcement learning , 2004, ICML 2004.

[17]  Sham M. Kakade,et al.  A Natural Policy Gradient , 2001, NIPS.

[18]  Nikolaus Hansen,et al.  Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed , 2009, GECCO '09.