Feature learning using state differences

Domain-independent feature learning is a hard problem. This is reflected by lack of broad research in the area. The goal of General Game Playing (GGP) can be described as designing computer programs that can play a variety of games given only a logical game description. Any learning has to be domain...

Full description

Bibliographic Details
Main Author: KIRCI, MESUT
Other Authors: Schaeffer, Jonathan (Computing Science)
Format: Others
Language:en
Published: 2010
Subjects:
Online Access:http://hdl.handle.net/10048/1011
id ndltd-LACETR-oai-collectionscanada.gc.ca-AEU.10048-1011
record_format oai_dc
spelling ndltd-LACETR-oai-collectionscanada.gc.ca-AEU.10048-10112012-03-21T22:50:08ZSchaeffer, Jonathan (Computing Science)Sturtevant, Nathan (Computing Science)KIRCI, MESUT2010-02-03T18:29:16Z2010-02-03T18:29:16Z2010-02-03T18:29:16Zhttp://hdl.handle.net/10048/1011Domain-independent feature learning is a hard problem. This is reflected by lack of broad research in the area. The goal of General Game Playing (GGP) can be described as designing computer programs that can play a variety of games given only a logical game description. Any learning has to be domain-independent in the GGP framework. Learning algorithms have not been an essential part of all successful GGP programs. This thesis presents a feature learning approach, GIFL, for 2-player, alternating move games using state differences. The algorithm is simple, robust and improves the quality of play. GIFL is implemented in a GGP program, Maligne. The experiments show that GIFL outperforms standard UCT algorithm in nine out of fifteen games and loses performance only in one game.448610 bytesapplication/pdfenfeature learninggeneral game playingFeature learning using state differencesThesisMaster of ScienceMaster'sDepartment of Computing ScienceUniversity of Alberta2010-06Buro, Michael (Computing Science)Gouglas, Sean (History and Classics)
collection NDLTD
language en
format Others
sources NDLTD
topic feature learning
general game playing
spellingShingle feature learning
general game playing
KIRCI, MESUT
Feature learning using state differences
description Domain-independent feature learning is a hard problem. This is reflected by lack of broad research in the area. The goal of General Game Playing (GGP) can be described as designing computer programs that can play a variety of games given only a logical game description. Any learning has to be domain-independent in the GGP framework. Learning algorithms have not been an essential part of all successful GGP programs. This thesis presents a feature learning approach, GIFL, for 2-player, alternating move games using state differences. The algorithm is simple, robust and improves the quality of play. GIFL is implemented in a GGP program, Maligne. The experiments show that GIFL outperforms standard UCT algorithm in nine out of fifteen games and loses performance only in one game.
author2 Schaeffer, Jonathan (Computing Science)
author_facet Schaeffer, Jonathan (Computing Science)
KIRCI, MESUT
author KIRCI, MESUT
author_sort KIRCI, MESUT
title Feature learning using state differences
title_short Feature learning using state differences
title_full Feature learning using state differences
title_fullStr Feature learning using state differences
title_full_unstemmed Feature learning using state differences
title_sort feature learning using state differences
publishDate 2010
url http://hdl.handle.net/10048/1011
work_keys_str_mv AT kircimesut featurelearningusingstatedifferences
_version_ 1716390586546651136