Algorithmic Approaches to Playing Minesweeper

DSpace/Manakin Repository

Algorithmic Approaches to Playing Minesweeper

Citable link to this page

 

 
Title: Algorithmic Approaches to Playing Minesweeper
Author: Becerra, David J.
Citation: Becerra, David J. 2015. Algorithmic Approaches to Playing Minesweeper. Bachelor's thesis, Harvard College.
Full Text & Related Files:
Abstract: This 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.
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:14398552
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)

 
 

Search DASH


Advanced Search
 
 

Submitters