Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp01sb397843f
Title: Applying Bandit-Based Monte Carlo Tree Search to Playing Big Two
Authors: Yan, Chengmu
Advisors: Bubeck, Sebastien
Department: Operations Research and Financial Engineering
Class Year: 2014
Abstract: We investigate the application of a Monte Carlo Tree Search-based approach to AI game playing for the card game Big Two, a sequential, multiplayer game of imperfect information. After implementing several different types of AI players, we evaluate them in their performance relative to one another, focusing on the interplay between the game tree search strategy, multi-armed bandit selection policy, and heuristic playout strategy. We find that an MCTS approach is generally effective in this domain, particularly when paired with a strong heuristic playout strategy and a properly tuned selection policy.
Extent: 100
URI: http://arks.princeton.edu/ark:/88435/dsp01sb397843f
Type of Material: Princeton University Senior Theses
Language: en_US
Appears in Collections:Operations Research and Financial Engineering, 2000-2016

Files in This Item:
File SizeFormat 
Yan,Chengmu final thesis.pdf6.13 MBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.