Bachelor Thesis from the year 2013 in the subject Computer Science - Applied, grade: 2,0, University of Hannover, language: English, abstract: Before elaborating on the complexity of Minesweeper, the basic ideas of complexity theory and the rules of the game shall be introduced. Both subjects should be internalized in order to understand the contents of this bachelor thesis. The basics are learned from: Introduction to the Theory of Complexity by M. Sipser [20], H. Vollmer Skript zur Vorlesung Komplexität von
Algorithmen [21] and S. Arora and B. Barak Computational Complexity: A Modern Approach [19].
Further, this bachelor thesis will be based upon the main results of these two papers:
Minesweeper is NP complete by R. Kaye [1],
Minesweeper May Not Be NP-Complete but Is Hard Nonetheless by A. Scott [2].
