Skip navigation
Please use this identifier to cite or link to this item:
Title: Solving Pineapple: An Appplication of Monte-Carlo Tree Search and an Inverstigation of Selection Heuristics
Authors: Govindaiah, Likith
Advisors: Wang, Mengdi
Contributors: Fickenscher, Jonathan M.
Department: Mathematics
Class Year: 2017
Abstract: In this paper we give a brief survey of Monte Carlo tree search and provide an application of it in solving the game of Open Face Chinese Poker Pineapple. We also describe how effective pruning methods reduce the size of the game tree and performance of the algorithm. Finally, we test the solver against a commercially available AI to evaluate the practical accuracy of our approach.
Type of Material: Princeton University Senior Theses
Language: en_US
Appears in Collections:Mathematics, 1934-2020

Files in This Item:
File SizeFormat 
likithgovindaiah.pdf362.51 kBAdobe PDF    Request a copy

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