designing artificial tetris players with evolution strategies and racing
This article describes how racing procedures in evolution strategies can help reduce the number of evaluations. This idea is illustrated on learning Tetris players which can be addressed as a stochastic optimization problem. Different experiments show the benefits of the racing procedures in evolution strategies which can significantly reduce the number of evaluations.
tetris players evolution strategies racing algorithms