Change search
ReferencesLink to record
Permanent link

Direct link
En studie i röj
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2000 (Swedish)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

This paper presents a study of the computer game ”Minesweeper”. The aim of the game is to search through a rectangular area of mined squares without hitting any mines. By using a strategy based on making every operation as safe as possible, series of the game have been simulated. The size of the playground is four times four squares. The si- mulations indicate how often the game will succeed and which square is the best one to start at. The strategy demands advanced mathematical calculations. The account of these is the ma- jor part of my work. My investigation shows that if there are three hidden mines the game will succeed about two times out of three. It also shows that the best startingpoint is a corner.

Place, publisher, year, edition, pages
2000. , 43 p.
Keyword [en]
Binary variables, Gauss Jordan elimination, independent island, neighbour, proba- bility, simulation, system of equations.
National Category
Probability Theory and Statistics
URN: urn:nbn:se:umu:diva-51342OAI: diva2:479159
Physics, Chemistry, Mathematics
Available from: 2012-10-31 Created: 2012-01-17 Last updated: 2012-10-31Bibliographically approved

Open Access in DiVA

fulltext(243 kB)159 downloads
File information
File name FULLTEXT01.pdfFile size 243 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Department of Mathematics and Mathematical Statistics
Probability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar
Total: 159 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 44 hits
ReferencesLink to record
Permanent link

Direct link