Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp01g158bm02h
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorLi, Xiaoyan-
dc.contributor.authorAkiti, Korle-
dc.date.accessioned2018-08-14T14:40:42Z-
dc.date.available2018-08-14T14:40:42Z-
dc.date.created2018-05-06-
dc.date.issued2018-08-14-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp01g158bm02h-
dc.description.abstractThis paper follows research applying Machine Learning to the board game Settlers of Catan with the aim of comparing the performance of pure strategies to those of mixed strategies. The mixture of deterministic and non-deterministic elements in Catan presents a unique challenge for AI development, leading to a well-established area of research devoted to the subject. Most existing research implements pure AI strategies that focus either on top-down or bottom-up techniques. Top-down AI aim to capitalize on an AI's ability to outclass human's implementation of proven techniques. Bottom-up AI aim to combine a general learning algorithm with a vast memory database of previously encountered gameplay that will improve the AI's performance as the database grows. Both have their respective weaknesses as top-down strategies tend to neglect prior information and bottom-up strategies tend to struggle to adapt to novel situations. The mixed strategy developed by the author seeks specifically to combine both pure top-down and bottom-up AI strategies where each would compensate for the other's weakness. The pure top-down AI strategy was implemented through an Alpha-Beta search algorithm that prunes decision-making trees generated from gameplay. The pure bottom-up AI strategy was independently defined and developed by the author and operated on two simple concepts: gameplay configuration mapping and mapping comparison. The mixed strategy AI was implemented as the previously defined pure bottom-up AI with a top-down AI acting as a failsafe for move quality. The performance of these three strategies against an AI playing random moves was used to compare them. The thesis of this paper is that the mixed strategy AI would outperform both pure strategy AIs. Initial results showed the pure top-down AI performing the best, followed by the mixed strategy AI, followed by the pure bottom-up AI. While this tentatively supports the author's thesis, further research is needed to make a stronger conclusion. Future research would likely also include testing against human players and adapting implementation to support Catan expansions.en_US
dc.format.mimetypeapplication/pdf-
dc.language.isoenen_US
dc.titleMixed Strategies in Machine Learning and Catanen_US
dc.typePrinceton University Senior Theses-
pu.date.classyear2018en_US
pu.departmentComputer Scienceen_US
pu.pdf.coverpageSeniorThesisCoverPage-
pu.contributor.authorid960962596-
Appears in Collections:Computer Science, 1988-2020

Files in This Item:
File Description SizeFormat 
AKITI-KORLE-THESIS.pdf3.61 MBAdobe PDF    Request a copy
Akiti_Thesis_SupplementaryMaterials.zip12.08 MBUnknown    Request a copy


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