Download the full-sized PDF of Temporal Abstraction in Monte Carlo Tree SearchDownload the full-sized PDF



Permanent link (DOI):


Export to: EndNote  |  Zotero  |  Mendeley


This file is in the following communities:

Graduate Studies and Research, Faculty of


This file is in the following collections:

Theses and Dissertations

Temporal Abstraction in Monte Carlo Tree Search Open Access


Other title
Monte Carlo Tree Search
Temporal Abstraction
Computer Games
Artificial Intelligence
Type of item
Degree grantor
University of Alberta
Author or creator
Vafadost, Mostafa
Supervisor and department
Bowling, Michael (Computing Science)
Examining committee member and department
Müller, Martin (Computing Science)
Holte, Robert (Computing Science)
Department of Computing Science

Date accepted
Graduation date
Master of Science
Degree level
Given nothing but the generative model of the environment, Monte Carlo Tree Search techniques have recently shown spectacular results on domains previously thought to be intractable. In this thesis we try to develop generic techniques for temporal abstraction inside MCTS that would allow the effective construction of medium/long term plans in arbitrary Atari 2600 games. We introduce two methods: 1- CTW-UCT, that uses CTW algorithm to extract information from expert trajectories in order to make use of this information in search. 2- Variable Time Scale (VTS), that finds the desired time scale for taking each action online. We found that, CTW-UCT did not achieve satisfactory results. The VTS algorithm, however, was shown to be a promising algorithm. Although VTS did not achieve the highest individual scores on any game, it performed close to the best on most of the games. In other words, compared to different UCT algorithms that make use of macro actions with repeated actions of pre-specified lengths, VTS achieved comparable results to the best score on most of the games. We conclude therefore that, for domains where we do not know the desired time scale, VTS can be a good option.
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
Audit Status
Audits have not yet been run on this file.
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 668308
Last modified: 2015:10:12 11:36:33-06:00
Filename: Vafadost_Mostafa_Fall 2013.pdf
Original checksum: 38c4a0df08ab90fbc41f87dd0c213a2b
Well formed: true
Valid: true
Page count: 57
Activity of users you follow
User Activity Date