ERA

Download the full-sized PDF of Investigating UCT and RAVE: steps towards a more robust methodDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3WX3C

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Faculty of Graduate Studies and Research

Collections

This file is in the following collections:

Theses and Dissertations

Investigating UCT and RAVE: steps towards a more robust method Open Access

Descriptions

Other title
Subject/Keyword
Monte-Carlo
RAVE
Abstract Games
UCT
Artificial Intelligence
RAVE-max
Type of item
Thesis
Degree grantor
University of Alberta
Author or creator
Tom, David
Supervisor and department
Mueller, Martin (Computing Science)
Examining committee member and department
Buro, Michael (Computing Science)
Hayes, Robert (Chemical and Materials Engineering)
Department
Department of Computing Science
Specialization

Date accepted
2010-04-14T15:25:21Z
Graduation date
2010-06
Degree
Master of Science
Degree level
Master's
Abstract
The Monte-Carlo Tree Search (MCTS) algorithm Upper Confidence bounds applied to Trees (UCT) has become extremely popular in computer games research. Because of the importance of this family of algorithms, a deeper understanding of when and how their different enhancements work is desirable. To avoid hard-to-analyze intricacies of tournament-level programs in complex games, this work focuses on a simple abstract game: Sum of Switches (SOS). In the SOS environment we measure the performance of UCT and two of popular enhancements: Score Bonus and the Rapid Action Value Estimation (RAVE) heuristic. RAVE is often a strong estimator, but there are some situations where it misleads a search. To mimic such situations, two different error models for RAVE are explored: random error and systematic bias. We introduce a new, more robust version of RAVE called RAVE-max to better cope with errors.
Language
English
DOI
doi:10.7939/R3WX3C
Rights
License granted by David Tom (dtom@ualberta.ca) on 2010-04-14T13:05:49Z (GMT): Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of the above terms. The author reserves all other publication and other rights in association with the copyright in the thesis, and except as herein provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication

File Details

Date Uploaded
Date Modified
2014-05-01T02:23:29.907+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 433743
Last modified: 2015:10:12 16:59:55-06:00
Filename: Tom_David_Spring 2010.pdf
Original checksum: 11807adbcf44ab17bb62edcab3293d7b
Well formed: true
Valid: false
Status message: Improperly formed date offset=427545
File title: ../graphs/Faux8Diff.ps
File author: David Tom
Page count: 49
Activity of users you follow
User Activity Date