Vis enkel innførsel

dc.contributor.advisorDowning, Keithnb_NO
dc.contributor.authorAmundsen, Jonas Balgaardnb_NO
dc.date.accessioned2014-12-19T13:41:24Z
dc.date.available2014-12-19T13:41:24Z
dc.date.created2014-09-30nb_NO
dc.date.issued2014nb_NO
dc.identifier751065nb_NO
dc.identifierntnudaim:11421nb_NO
dc.identifier.urihttp://hdl.handle.net/11250/253727
dc.description.abstractFinding optimal strategies for the game of Tetris is an interesting NP-complete problem that has attracted several AI researchers. Their approaches display subtle variations in the implementation details, with unclear relationships between these details and Tetris performance. This, combined with the absence of confidence intervals in most published results, makes the evaluation and comparison of Tetris strategies and optimization methods very difficult.To look furhter into this unclear relationship, we would re-create every environnment described in several publications. An evolutionary algorithm was executed within each environment to create an AI and their performance compared against each other. The scores differed \textit{substantially}. This suggests that some aspects of the Tetris environment greatly affects the potentially obtainable performance of an AI. We come to the unfortunate conclusion that nearly no results of existing publications can be used to compare optimization methods against each other in terms of suitability for Tetris due to this reason.nb_NO
dc.languageengnb_NO
dc.publisherInstitutt for datateknikk og informasjonsvitenskapnb_NO
dc.titleA comparison of feature functions for Tetris strategiesnb_NO
dc.typeMaster thesisnb_NO
dc.source.pagenumber85nb_NO
dc.contributor.departmentNorges teknisk-naturvitenskapelige universitet, Fakultet for informasjonsteknologi, matematikk og elektroteknikk, Institutt for datateknikk og informasjonsvitenskapnb_NO


Tilhørende fil(er)

Thumbnail
Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel