ERA

Download the full-sized PDF of Move Groups as a General Enhancement for Monte Carlo Tree SearchDownload the full-sized PDF

Analytics

Share

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

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Graduate Studies and Research, Faculty of

Collections

This file is in the following collections:

Theses and Dissertations

Move Groups as a General Enhancement for Monte Carlo Tree Search Open Access

Descriptions

Other title
Subject/Keyword
monte carlo
move groups
tree search
Type of item
Thesis
Degree grantor
University of Alberta
Author or creator
Van Eyck, Gabriel
Supervisor and department
Mueller, Martin (Computing Science)
Examining committee member and department
Mackenzie, Marc (Oncology)
Mueller, Martin (Computing Science)
Buro, Michael (Computing Science)
Department
Department of Computing Science
Specialization

Date accepted
2014-02-18T14:22:47Z
Graduation date
2014-06
Degree
Master of Science
Degree level
Master's
Abstract
Monte Carlo tree search (MCTS) combined with the upper confidence bounds applied to trees (UCT) algorithm has brought forth many advances in game related AI. This includes general game players and programs for specific games such as Amazons, Arimaa, and Go. However, there often is a need for further enhancements beyond this to make the strongest player for a given game. Move groups are investigated in detail to determine their effect on MCTS as a general enhancement. The structures of move groups that increase performance in an artificial game are analyzed then applied without knowledge of move values. We noted that there is a speed increase in the tree while maintaining performance for a fixed number of simulations. Finally, move groups are applied to the game of Amazons successfully.
Language
English
DOI
doi:10.7939/R3513V420
Rights
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 these terms. The author reserves all other publication and other rights in association with the copyright in the thesis and, except as herein before 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-06-15T07:13:01.274+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: 655727
Last modified: 2015:10:12 17:10:41-06:00
Filename: GabrielVanEyck-ThesisRevisedFinal2014.pdf
Original checksum: 36ac8b074c30478e03cf5979f0955f18
Well formed: true
Valid: true
File title: Introduction
File title: Move Groups as a General Enhancement for Monte Carlo Tree Search
File author: Gabriel Van Eyck
Page count: 57
Activity of users you follow
User Activity Date