Is there a way to get that Minesweeper effect where when you hit a 0, the field spreads until the boundaries are non zero integers? Like on this

2 + 1 0 0 0 1 + 1 0

+ 2 1 0 0 0 1 1 1 0

1 1 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0

So when you hit one of the zeroes, it reveals every 0 square and the numbers except the 2 that isn't adjacent to any zeros? I did create an algorithm that does it already, but it commonly hits boundary errors and is ridiculously slow (it uses three For( loops, a Repeat, and a few If:Then's. In fact, it works quite nicely, but it is painfully slow and it is prone to random boundary errors. Does anyone know a quick efficient way to do this?

~

`Timothy`

Timothy Foster - @tfAuroratide

Auroratide.com - Go here if you're nerdy like me