Skip to content

You are presented with a field of squares. Some squares contain mines (bombs), others don't. If you click on a square containing a bomb, you lose. If you manage to click all the squares (without clicking on any bombs) you win.

Notifications You must be signed in to change notification settings

Manshi-M/Minesweeper-Game

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 

Repository files navigation

Minesweeper-Game

PROBLEM STATEMENT You are presented with a field of squares. Some squares contain mines (bombs), others don't. If you click on a square containing a bomb, you lose. If you manage to click all the squares (without clicking on any bombs) you win. Clicking a square which doesn't have a bomb reveals the number of neighbouring squares containing bombs. Use this information plus some guess work to avoid the bombs. A square’s "neighbours" are the squares adjacent above, below, left, right, and all 4 diagonals. Squares on the sides of the board or in a corner have fewer neighbors. The board does not wrap around the edges. If you open a square with 0 neighboring bombs, all its neighbors will automatically open. This can cause a large area to automatically open.

MATHEMATICAL BACKGROUND

Probability of finding a mine =minessize*size

Beginner level = 10/81 =0.12

Intermediate level =40/256=0.15

Advanced level=99/576=0.17

About

You are presented with a field of squares. Some squares contain mines (bombs), others don't. If you click on a square containing a bomb, you lose. If you manage to click all the squares (without clicking on any bombs) you win.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages