Skip navigation
Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributorFickenscher, Jonathan M.-
dc.contributor.advisorWang, Mengdi-
dc.contributor.authorGovindaiah, Likith-
dc.description.abstractIn 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.en_US
dc.titleSolving Pineapple: An Appplication of Monte-Carlo Tree Search and an Inverstigation of Selection Heuristicsen_US
dc.typePrinceton University Senior Theses-
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.