• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Minesweeper. Varianten und Komplexität

Minesweeper. Varianten und Komplexität

Paperback

ApplicationsProgramming

ISBN10: 3656541086
ISBN13: 9783656541080
Publisher: Grin Verlag
Published: Nov 29 2013
Pages: 60
Weight: 0.20
Height: 0.14 Width: 5.83 Depth: 8.27
Language: English
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].

Also in

Applications