Use case diagram for minesweeper game update#
Use case diagram for minesweeper game code#

Use case diagram for minesweeper game code#

Sonarcloud: Click here to go to project dashboard Clean CodeД¬lean code development is a coding paradigm that follows a few coding principles. However, all other metrics are in 'green stages' which means that all other performance indicators for the code are appropriate for this small project. Currently the tool detects low code coverage as only a small simple test file for game.js has been written. Hence, some quality gate conditions are ignored because of the project's size. The Sonar scanner detects that this project is a very small one with 118 lines of code.

It can integrate with any existing workflow to enable continuous code inspection across all project branches and pull requests. This is an automatic code review tool to detect bugs, vulnerabilities and code smells in the code. In order to analyze many metrics at once, I utilize the SonarQube Scanner. For this pet project, I produced two behavioral diagrams and one structural diagram: Use case diagram The following diagrams are following the UML notation.

Run commands like so: ayMove(0, 1) and ayMove(1, 2).

let game = new Game(3, 3, 3) (create a Game instance with Game(numberOfRows, numberOfColumns, numberOfBombs)).

load game.js (to load the contents of this file) To start the game (1-3), to play (4) and to exit (5) the game It can be a small squared 3x3 game board or aД®xample: initialize, loose and win the game:ДЄfter you have successfully pulled the project from this repository, open a terminal on your local machine and navigate to the lib directory. The game is a console-only game and the project code can be executed using node.Д®ach game can be initialized with dimensions of the users choice. The code is an adaption of a project from an intensive program Build Front-End Web Applications from Scratch found on Codecademy, in which I participated to learn JavaScript earlier in 2018. The idea behind the pet project is to get back into coding and apply a list of topics that have been taught during the lecture of the module Advanced Softwareengineering.

Use case diagram for minesweeper game update#

They arranged it so that if you uncover a mine on the first move, it would swap that square with another safe square, guaranteeing that your first move is always safe.ДЇor this implementation I'm just going to update the code slightly to take the starting point out of the board coordinates, so that it doesn't get picked as a mine.This is a simple console output-only game written in vanilla JavaScript. Often Minesweeper games will make it so that you can't lose on your first move. When you start out with the board completely covered, you could end up uncovering a mine on your first square and losing the game immediately. I mentioned that in more advanced games, some guessing might be necessary, and that is also the case with the first square that you uncover in game. One reason why programmers like Minesweeper is because it is mostly a game of logic and you can use the numbered squares to figure out where the mines are. This code creates a consistent Minesweeper board with randomly placed mines.

Just iterate through the mine_coordinates and assign the cell at each mine coordinate in the board matrix a 9, and then look at each of its neighbors in and increment the value in that square by one, as long as it's not a mine. If 0 <= n <= cols-1 and 0 <= n <= rows-1 and n not in mine_coordinates: We'll create a 9 x 9 board with 10 mines. In the next post on playing Minesweeper we will get into this more, but for now we are just going to generate the board. In more difficult games, there may be an element of guessing involved, when you are left with squares that could equally likely be mines or safe squares. The game continues, and in some games you will be able to win just by using this strategy. If there is a square that is obviously not a mine, then it can be safely uncovered.

You can see that the red stars have to be mines because the 1 squares diagonal to each of them have no other adjacent neighbors that could be a mine except for the one covered square, so therefore, that square must be a mine. Here the purple dot is the starting point, and then the two red stars are covered squares that have to be mines. So then you can go around that perimeter and see if you can identify any unknown squares that would definitely be mines, or definitely be safe.