Algorithmic Approaches to Playing Minesweeper
MetadataShow full item record
CitationBecerra, David J. 2015. Algorithmic Approaches to Playing Minesweeper. Bachelor's thesis, Harvard College.
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.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:14398552
- FAS Theses and Dissertations 
Contact administrator regarding this item (to report mistakes or request changes)