Playing the Original Game Boy Tetris Using a Real Coded Genetic Algorithm

被引：2

作者：

da Silva, Renan Samuel ^{[1
]}

Parpinelli, Rafael Stubs ^{[1
]}

机构：

[1] Univ Estado Santa Catarina, Grad Program Appl Comp, Joinville, Brazil

来源：

2017 6TH BRAZILIAN CONFERENCE ON INTELLIGENT SYSTEMS (BRACIS) | 2017年

关键词：

Genetic Algorithm; Emulation; Tetris;

D O I：

10.1109/BRACIS.2017.15

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Tetris is a very popular game, having sold more than 450 millions units according to Forbes and it is also a very popular research subject in the field of Artificial Intelligence and Computational Intelligence. This work has two main goals. The first goal consists of providing a standardized testing scenario based on an Emulator to run the Original Tetris Game. The second goal is to test several feature sets found in the literature in the proposed Real Coded Genetic Algorithm Based Agent. The results obtained showed the viability of having an agent playing the Original Tetris Game.

引用

页码：282 / 287

页数：6

共 21 条

[1]

[Anonymous], 2003, TETRIS IS HARD MADE

[2]

[Anonymous], 1996, LIDSP2349 MIT

[3]

[Anonymous], DESIGN GOOD TETRIS P

[4]

[Anonymous], 2005, 6 MET INT C MIC2005

[5]

[Anonymous], 2011, INT J COMPUT SCI ISS

[6]

[Anonymous], COMP INT GAM 2009 CI

[7] Tetris is hard, even to approximate [J].

Breukelaar, R ;

Demaine, ED ;

Hohenberger, S ;

Hoogeboom, HJ ;

Kosters, WA ;

Liben-Nowell, D .

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2004, 14 (1-2) :41-68

[8]

Burgiel H., 1997, The Mathematical Gazette, V81, P194

[9]

Chen X., 2009, Proceedings of the 11th Annual conference on Genetic and evolutionary computation, P1741

[10] Graph kernels and Gaussian processes for relational reinforcement learning [J].

Driessens, Kurt ;

Ramon, Jan ;

Gaertner, Thomas .

MACHINE LEARNING, 2006, 64 (1-3) :91-119

← 1 2 3 →