Bachelor's theses

Bachelor's theses 219,245 records found  beginprevious140355 - 140364nextend  jump to record: Search took 0.00 seconds. 
Minesweeper game - computational complexity and solver implemetation
Hoder, Kryštof ; Fiala, Jiří (advisor) ; Pangrác, Ondřej (referee)
In the present work we study construction of tree decompositions with respect to graphs useful for playing the Minesweeper game. We also formalize rules of the game and present necessary terminology. We provide the set of game configurations whose consistency can be decided in polynomial time - problem of consistency-deciding of general game configuration has been proven NP-compete in other works. We also provide algorithms that classify game configurations and decide about consistency of those configurations, which we can decide about in polynomial time.

Bachelor's theses : 219,245 records found   beginprevious140355 - 140364nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.