I have create my first A* algorithm with uses an open list and then selects the cell with the lowest proposed distance, opening more cells to the open list.
My problem is I don't know the best method to ensure only the best route is kept (in a stack/array?) Please view the video below and you can see how the alogrithm is currently working. The green squares are closed visited cells and the purple cells are on the open list.
YouTube - Fire Simulation 3