Show simple item record

dc.contributor.authorBecerra, David J.en_US
dc.date.accessioned2015-04-09T13:56:07Z
dc.date.created2015-05en_US
dc.date.issued2015-04-08en_US
dc.date.submitted2015en_US
dc.identifier.citationBecerra, David J. 2015. Algorithmic Approaches to Playing Minesweeper. Bachelor's thesis, Harvard College.en_US
dc.identifier.urihttp://nrs.harvard.edu/urn-3:HUL.InstRepos:14398552
dc.description.abstractThis thesis explores the challenges associated with designing a Minesweeper solving algorithm. In particular, it considers how to best start a game, various heuristics for handling guesses, and different strategies for making deterministic deductions. The paper explores the single point approach and the constraint satisfaction problem model for playing Minesweeper. I present two novel implementations of both of these approaches called double set single point and connected components CSP. The paper concludes that the coupled subsets CSP model performs the best overall because of its sophisticated probabilistic guessing and its ability to find deterministic moves.en_US
dc.format.mimetypeapplication/pdfen_US
dc.language.isoenen_US
dash.licenseLAAen_US
dc.subjectComputer Scienceen_US
dc.subjectMathematicsen_US
dc.titleAlgorithmic Approaches to Playing Minesweeperen_US
dc.typeThesis or Dissertationen_US
dash.depositing.authorBecerra, David J.en_US
dc.date.available2015-04-09T13:56:07Z
thesis.degree.date2015en_US
thesis.degree.grantorHarvard Collegeen_US
thesis.degree.levelUndergraduateen_US
thesis.degree.nameABen_US
dc.type.materialtexten_US
thesis.degree.departmentComputer Scienceen_US
dash.identifier.vireohttp://etds.lib.harvard.edu/college/admin/view/84en_US
dash.title.page1en_US
dash.author.emaildjb9306@gmail.comen_US
thesis.degree.department-secondaryMathematicsen_US
dash.identifier.drsurn-3:HUL.DRS.OBJECT:25267837en_US
dash.contributor.affiliatedBecerra, David


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record