Who implements getNeighbors() method? - java help on CodeGym

https://codegym.cc/tasks/com.codegym.games.minesweeper.part06 Should I implemet getNeighbors() method myself? Compiler can not find this method. com/codegym/games/minesweeper/part06/MinesweeperGame.java:35: error: cannot find symbol symbol: method getNeighbors(com.codegym.games.minesweeper.part06.GameObject) location: class com.codegym.games.minesweeper.part06.MinesweeperGame

package com.codegym.games.minesweeper;

import com.codegym.engine.cell.*;

public class MinesweeperGame extends Game {
    private static final int SIDE = 9;
    private int countMinesOnField;
    private GameObject[][] gameField = new GameObject[SIDE][SIDE];

    public void initialize() {
        setScreenSize(SIDE, SIDE);
        createGame();
    }

    private void createGame(){
        for(int i=0; i<SIDE; i++){
            for(int j=0; j<SIDE; j++){
                boolean isMine=false;
                if (j==getRandomNumber(10)){
                    isMine=true;
                    countMinesOnField++;
                }
                gameField[i][j] = new GameObject(j,i,isMine);
                setCellColor(i,j, Color.RED);
                            }
        }
        countMineNeighbors();
    }

    private void countMineNeighbors(){
        for(int i=0; i<SIDE; i++){
            for(int j=0; j<SIDE; j++){
                if (!(gameField[i][j].isMine)){
                    //getNeighbors(gameField[i][j]);
                    gameField[i][j].countMineNeighbors = getNeighbors(gameField[i][j]);
                }
                gameField[i][j].countMineNeighbors=0;
                return;
            }
        }
        return;
    }
}

private List getNeighbors(GameObject gameObject) { List result = new ArrayList<>(); for (int y = gameObject.y - 1; y <= gameObject.y + 1; y++) { for (int x = gameObject.x - 1; x <= gameObject.x + 1; x++) { if (y < 0 || y >= SIDE) { continue; } if (x < 0 || x >= SIDE) { continue; } if (gameField[y][x] == gameObject) { continue; } result.add(gameField[y][x]); } } return result; }

private List<GameObject> getNeighbors(GameObject gameObject) { List<GameObject> result = new ArrayList<>(); //The loop checks all eight surrounding fields no matter if they are "in bounds" //It always starts one row above (y-1) and finishes one row below(y+1) for (int y = gameObject.y - 1; y <= gameObject.y + 1; y++) { //It always checks one column to the left(x-1) and finishes one column to the right(x+1) for (int x = gameObject.x - 1; x <= gameObject.x + 1; x++) { //Here is the first statement that checks if the column value is out of bounds (left or right) if (y < 0 || y >= SIDE) { continue; // if the index is not "on the field", we simply ignore it } // Here we check the same with the rows: if (x < 0 || x >= SIDE) { continue; // and simply ignore it if it is out of bounds } //Finally, we ignore the field we are currently checking (because it is obviously part of the for-loops and we don't want to count itself, but only its neighbors if (gameField[y][x] == gameObject) { continue; } //Here we add all the cells that are inside the bounds of the playing field result.add(gameField[y][x]); } } //And we return a list of all neighbors of the current field (which we can traverse in the countMineNeighbors-method later on return result; }

Comments (3)

Popular
New
Old

You must be signed in to leave a comment

Roman

Level 41

14 April 2020, 13:48

I have checked this task and I've received this method:

horst

Level 26 , Not in list

14 April 2020, 11:33

I honestly can't remember how it was, but I thought that getNeighbors() was given to us and magically appeared at the bottom of the MinesweeperGame class. However, I found this older question where user zendro claims having it implemented by him/herself. Just in case that you don't get more reliable answers about this issue here in the help-section, I have decided to copy my version of the getNeighbors() method below. I know that I am taking away from you the incredible joy of implementing the method by yourself, so I at least added some comments to talk you through what the method does in order to not make this a meritless copy-paste-thing. The basic idea is quite simple: You have to check all the surrounding fields with two loops starting top left ( one row above (y - 1) and one column to the left (x -1), working through to the bottom right adjacent field (y+1, x+1). But how do we deal with fields in the corners and on the sides that have less that eight neighbors without stepping out of bounds of the List? Have a look:

14 April 2020, 11:40