Minesweeper

You are presented with a board of squares. Some squares contain mines (bombs), others don’t. If you step on a square containing a bomb, you lose. If you manage to clear all the squares (without clicking on any bombs) you win. Clearing a square which doesn’t have a bomb reveals the number of neighbouring squares containing bombs. If you guess a square contains a bomb mark it with a flag. A squares “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 clear a square with 0 neighboring bombs, all its neighbors will automatically open; recursively. The first square you open could be a bomb. You don’t have to mark all the bombs to win; you just need to open all non-bomb squares

IN-PROGRESS exploration, base usecases

• State “IN-PROGRESS” from “TODO” [2021-06-29 Tue 07:49]

IN-PROGRESS US1

• State “IN-PROGRESS” from “TODO” [2021-06-29 Tue 07:51]

Description: As a player I want to start game by specifying board size and difficulty (number of mines) so that I can start playing game

UAT1 Given board size(n) create empty board with size n*n

UAT2 Given board of size n and number of mines (m), spread mines on board randomly so that number of mines is m

extract mines count into separate function