Abstract / Excerpt:

This paper presents a different method for adjusting weights of feature functions in the Tetris evaluation function. Using Bees Algorithm (BA), the number of rows cleared was measured to be higher. Results show much agreement with theoretical predictions and significant improvement over previous efforts by Particle Swarm Optimization (PSO). The work presented here has profound implications for future studies of building Tetris agents and may one day help solve the problem of Tetris being NP-Complete.

Info

Source Institution	Ateneo de Davao University
Unit	Computer Studies
Authors	Jessa Daang, Gregg Meyrick Jover
Page Count	24
Place of Publication	Davao City
Original Publication Date	March 1, 2016
Tags	Bees Algorithm, Tetris, Tetris Agent

Preview