Flood-Fill(-Esque) algorithm on a 2D grid

So in the Minesweeper game I launched recently, one of the small challenges was finding a way to optimise the Flood-Fill(-esque) algorithm I was using to uncover empty tiles across the grid and to find every tile that has a mine and explode / reveal it from in a wave out from the last mine if the player has won or from the mine that has already exploded. Its Flood-Fill(-esque) because floodfill was used for the empty tile reveal but not really for the end of game mines showing. It is however close enough of a topic to bundle in. There were 3 methods that were created / recreated…one of which is definitely not how to do Flood-Fill in a performance critical portion of the game…

Continue reading “Flood-Fill(-Esque) algorithm on a 2D grid”

Glass Engine 3


This is the 3 engine I’m building from scratch. The first was a 2D engine built in 2nd year at University and the second was built for my final year computing project. As there are less pressures and time restrictions on this one it should be more fully featured as well as more polished then its predecessors.  I should also point out that this isn’t a how-to guide or tutorial. It is just my observations and whats been occurring as I’m progressing through.

Continue reading “Glass Engine 3”