Using a Genetic Algorithm to Weight an Evaluation Function for Tetris
暂无分享,去创建一个
Tetris is a popular video-game invented by Alexey Pajitnov. An agent that plays Tetris must be able to place pieces in good positions without knowledge of what pieces will follow. One way such an agent can work is to use an evaluation function to place the current piece. This evaluation function is a weighted sum of features from the board. We used a genetic algorithm, based on Genitor, to discover these weights. We tried several things to improve the efficiency of the search for the weights, including different fitness evaluations and crossover operations.
[1] Erik D. Demaine,et al. Tetris is hard, even to approximate , 2002, Int. J. Comput. Geom. Appl..
[2] Takuji Nishimura,et al. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.
[3] Heidi Burgiel,et al. How to lose at Tetris , 1997, The Mathematical Gazette.
[4] Darrell Whitley,et al. A genetic algorithm tutorial , 1994, Statistics and Computing.