Minesweeper (Part 9/16)

3
Locked

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 p

You can't complete this task, because you're not signed in.

Comments (6)

Popular
New
Old

You must be signed in to leave a comment

Richi

Level 16 , Heilbronn, Deutschland

27 November 2020, 22:53

sorry for this error. I already solved my problem

Richi

Level 16 , Heilbronn, Deutschland

20 November 2020, 18:41

Last condition not met! but why? the programm does exactly what it shoud.

Roman

Level 41

23 November 2020, 06:15

Please post your question with the attached solution in the section Help.

Mike Taylor

Level 13 , Auckland, New Zealand

7 February 2020, 21:02

My code currently doesn't pass anything on requirements list. In the "openTile" method, I'm attempting to solve by calling recursively from list of "getNeighbors" (lines 58-60). Looking at other people's questions I see they coded explicitly which becomes lengthy. I could do similarly, but would really like to do proper recursion. Thanks

Mateo

Level 26 , Zagreb, Croatia

12 July 2019, 16:55

Can somebody explain the lasts condition: The openTile(int, int) method must not call anything if the element is not a mine and has no mined neighbors. Use an empty string. Its equal to first one

Roman

Level 41

15 July 2019, 13:51

I think, correct phrase is 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.