The countMineNeighbors() method should, for each non-mined cell ......

Question about the task

Minesweeper (Part 6/16)

Games, Level 0, Lesson 0

Resolved

Please somebody give us a hint. I'm starting to give up on this one Cheers

Now let's count the mines in adjacent cells. To do this, we'll add a field to each cell of the matrix, which will be responsible for the number of mined neighbors. First, we find all the neighbors, and then we count how many of them are mined.

To get the list of neighbors, you now have the getNeighbors() method, which has one GameObject (cell) parameter.

Your task is to, in a separate method, count the number of mined neighbors for each cell in gameField and assign this value to the appropriate field of the cell.

Although your work is not visible (you started program to see what happens, right?), it is very important to future steps.

Requirements:

The GameObject class must have a public int countMineNeighbors field.
The MinesweeperGame class must have a private void countMineNeighbors() method.
The countMineNeighbors() method should, for each non-mined cell in the gameField matrix, count the number of adjacent mined cells and assign this value to the countMineNeighbors field.
The countMineNeighbors() method should use the getNeighbors(GameObject gameObject) method.
In the createGame() method, after all the elements of the gameField matrix are created, the countMineNeighbors() method must be called.

package com.codegym.games.minesweeper; import com.codegym.engine.cell.*; import java.util.*; public class MinesweeperGame extends Game { private int countMinesOnField; private static final int SIDE = 9; private GameObject[][] gameField = new GameObject[SIDE][SIDE]; public void initialize(){ setScreenSize(SIDE, SIDE); createGame(); } private void createGame(){ for( int x=0; x<SIDE; x++ ){ for( int y=0; y<SIDE; y++){ int random = getRandomNumber(10); boolean isMine = false; if( random == 1){ isMine = true; countMinesOnField++; } gameField[x][y] = new GameObject(x, y, isMine); setCellColor(x, y, Color.ORANGE) ; } } countMineNeighbors(); } private void countMineNeighbors(){ for( int x=0; x<SIDE; x++ ){ for( int y=0; y<SIDE; y++){ if(!gameField[x][y].isMine){ ArrayList<GameObject> neibrList = getNeighbors(gameField[x][y]); int noOfMined = 0; for(GameObject neibr : neibrList){ if(neibr.isMine){ noOfMined++; } } gameField[x][y].countMineNeighbors = noOfMined; } } } } private ArrayList<GameObject> getNeighbors(GameObject cell){ ArrayList<GameObject> neibrList = new ArrayList<GameObject>(); int x = cell.x; int y = cell.y; if(validCell(x - 1, y - 1)) neibrList.add(gameField[x - 1][y - 1]); if(validCell(x, y - 1)) neibrList.add(gameField[x][y - 1]); if(validCell(x + 1, y - 1)) neibrList.add(gameField[x + 1][y - 1]); if(validCell(x - 1, y)) neibrList.add(gameField[x - 1][y]); if(validCell(x + 1, y)) neibrList.add(gameField[x + 1][y]); if(validCell(x - 1, y + 1)) neibrList.add(gameField[x - 1][y + 1]); if(validCell(x, y + 1)) neibrList.add(gameField[x][y + 1]); if(validCell(x + 1, y + 1)) neibrList.add(gameField[x + 1][y + 1]); return neibrList; } private boolean validCell(int x, int y){ int uppBound = 8; int bottBound = 0; return (x >= bottBound && x <= uppBound) && (y >= bottBound && y <= uppBound); } }

Comments (2)

Popular
New
Old

You must be signed in to leave a comment

Oana Mancu

Level 41 , Bucharest, Romania

17 October 2020, 11:53

solution

In the getNeighbours replace x with y and see what happens. You can try something quick like: int x = cell.y; int y = cell.x;

Pavel Naumovich

Level 16 , Chippenham, United Kingdom

17 October 2020, 13:59

It worked , thank you