Another first condition.. :)

Question about the task

Minesweeper (Part 9/16)

Games, Level 0, Lesson 0

Resolved

I tried many things but without success. Maybe you'll see what's wrong and a little help me. Thanks!

According to the rules, when a cell without adjacent mines is revealed, the game reveals the "unmined" area up to cells with mined neighbors. Let's implement it... I suggest using recursion. It is used when the algorithm for solving the problem is the same as the algorithm for solving part of the problem. Here's what we have.

When a cell with zero mined neighbors is revealed, we need to do a full search of all neighboring cells that haven't been revealed, call openTile(int, int) method on them, and repeat the process.

Additionally, in the openTile(int, int) method, we'll arrange to display the number of mined neighbors of a cell.

Run the game to verify that the implementation is correct.

Hint: if you get a java.lang.StackOverflowError, it means that you're setting the isOpen flag too late.

Requirements:

In the openTile(int, int) method, if the element is not a mine and has no mined neighbors, the openTile(int, int) method must be called recursively on each neighbor that hasn't been revealed.
The openTile(int, int) method must call the getNeighbors(GameObject) method if the element is not a mine and has no mined neighbors.
In the openTile(int, int) method, if the element is not a mine and has at least one mined neighbor, the number of mined neighbors must be displayed on the playing field. Use the setCellNumber(int, int, int) method.
The openTile(int, int) method must not display anything if the element is not a mine and has no mined neighbors. Use an empty string.

package com.codegym.games.minesweeper; public class GameObject { public int x; public int y; public boolean isMine; public int countMineNeighbors; public boolean isOpen; public boolean isFlag; public GameObject(int x, int y, boolean isMine) { this.x = x; this.y = y; this.isMine = isMine; } }

Comments (2)

Popular
New
Old

You must be signed in to leave a comment

Thomas

Level 41 , Bayreuth, Germany

19 November 2022, 08:40

solution

the check, if a gameField is not a mine, is nested within the code that executes when the gameField is a mine. Means the code for the gameField being not a mine will never run. The failed condition tells you: if the element is not a mine and has no mined neighbors Your code reads: if (!gameField[y][x].isMine || gameField[y][x].countMineNeighbors == 0) Find the difference :) Try to fix these two points first and when it still fails we'll have a closer look.

matemate123

Level 50 , Kraków, Poland

19 November 2022, 09:18

Unbeliveable, I did it, and you very help me. Starts with my stupid logicall error || --> && I change more things like 96 from countMinesOnField to gameField[y][x].countMineNeighbors , and of course you're first acapit I change in my sooner version but after that my mind explode and combination going on. Thanks a lot brother!