I couldn't find where the logic fails

Question about the task

Under discussion

Hey, I'm trying to implement mine sweeper game's 6th part but couldn't achieve the goal that indicated at 3rd condition. Could one of you guys please help me to understand the problem ? Thanks

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 static final int SIDE = 9; private GameObject[][] gameField = new GameObject[SIDE][SIDE]; private int countMinesOnField; @Override public void initialize() { setScreenSize(SIDE, SIDE); createGame(); } private void createGame() { int randNum = getRandomNumber(10); for (int x = 0; x < SIDE; x++) { for (int y = 0; y < SIDE; y++) { if (randNum == 4) { gameField[y][x] = new GameObject(x, y, true); countMinesOnField++; } else { gameField[y][x] = new GameObject(x, y, false); } setCellColor(x, y, Color.GREY); } } countMineNeighbors(); } private void countMineNeighbors() { for (int x=0; x<SIDE; x++) { for (int y=0; y<SIDE; y++) { if (!(gameField[x][y]).isMine){ getNeighbors(gameField[x][y]); } } } } private void getNeighbors(GameObject gameObject) { for (int x = gameObject.x - 1; x <= gameObject.x+1; x++) { for (int y = gameObject.y - 1; y <= gameObject.y+1; y++) { if(x >= 0 && y >= 0 && x < SIDE && y < SIDE) { if ((gameField[x][y]).isMine) { gameObject.countMineNeighbors++; } } } } } }

Comments (1)

Popular
New
Old

You must be signed in to leave a comment

Oleksii Osypenko

Level 8 , Warsaw, Poland

4 November 2019, 22:38

Line 50 gameField[y][x]).isMine. Just change places