minesweeper | minesweeper in pygame | Game Engine library

Trying my hands on a beginner minesweeper project and have a question on nested loops. I understand the basic when its with numbers. However, adding arrays and objects into a nested loop iteration is a bit tricky for mind and need some clarity (understanding the logic better).

For the below code, does the "const row = []" reset back to an empty array after every time the inner loop finishes pushing the "tile" variable into "row"? I am assuming it does since X will go to "1", which it'll reset the loop again?

Declaring boardSize as 2, I got an output of:
board First Iteration: [[{0,0}, {0,1}]]
board Second Iteration: [[{0,0}, {0,1}],[{1,0},{1,1}]]

I'm learning wxWidgets and am trying to make minesweeper using wxButtons. I use the following code to create and position the buttons:

Clicking on one of the tiles triggers clickerbox().

The issue is that if the user clicks on a tile with b no surrounding mines it's supposed to reveal them, and if any of those also have no mines it should do the same.

It seems to do some of this and then stop before revealing all the tiles it should. I was wondering if anyone knew why or how to fix this?

screenshot of the game board after a zero is clicked on

The first 5 clicks were made by the user then the rest where triggered by the function.

I have built a minesweeper algorithm for a cs50 assignment. I have identidied issue with my code. (Inside the minesweeper class)

The program needs both minesweeper.py and runner.py and is executed with "python runner.py"

Upon running it with python runner.py it gives me a RuntimeError:

I am Currently working on a minesweeper algorithm for a cs50 assignment. There seems to be an issue with my code. (Inside the minesweeper class)

The program needs both minesweeper.py and runner.py and is executed with "python runner.py"

Upon running it with python runner.py it gives me a RuntimeError:

Recently I've been trying to learn C++ through SFML. The Project I'm working on at the moment is Minesweeper (https://minesweeper.online/ if not familiar with the game). I want to avoid having to attach too much code so I'll explain step by step what the program does and elaborate on parts that run into issues.

1. A Grid object is created, containing two 2D arrays, grid and stategrid.
2. populate() populates grid with a certain amount of randomly placed mines, in this case 1 mine, for simplicity's sake.
3. the analyze() function fills in the amount of surrounding mines per tile.
4. the check() function checks if the mines are not too clumped together, if so, it repeats steps two and three.

An important thing to notice is that the stategrid array stores wether a tile has been 'discovered' or not. Another is that 'discovering' these tiles needs to be done recursively, as when you discover empty tiles, you must maneuver around corners and into cavities. The way I set this up is that when you 'open up' a specific tile with the dig() function and adjacent tiles are empty, these are opened aswell. The reason why this SO error surprised me is that I have set the condition that if a tile had been opened before, it could not be opened again as to avoid looping indefinitely, causing such an error.

Any help with this would be greatly appreciated.

PS: If this snippet of code is incomplete or additional information is required, please let me know.

PPS: It's quite late already where I live, so this could just be the result of late-night-blindness to details ;)

I am a beginner at python and decided to attempt to make minesweeper. Everything seems to be working correctly, but the section of my code responsible for filling a dictionary with data on every square does not seem to be working. here is the function in question:

I was trying a very simple thing with javascript, to create a minesweeper grid.

I have been looking for a way to export a JAR file from my project that manages to always play the sound files no matter where it is located. For this I wrote the following code that returns an exact path to the file.