Hi,
I'm working on a clone of the classic Minesweeper game. If you are familiar with it, you know that if you click on an empty square, the squares surrounding it will reveal themselves and the squares around ALL empty spaces, that become revealed, will then become revealed.
I am familiar with the flood fill algorithm, but Java can't handle the recursion in the algorithm.
Can someone help me with implementing an algorithm which will flood fill in a 2D array of JButton objects?
A good link for flood fill can be found
here . I could be misunderstanding how the algorithm works.