It works

I think the best option is to make sure to have ‘sorted’ the calls to the fire tiles, you can do that by having them in a separate grid or just stash them to a small local array on stack when you encounter them, and investigate those at the end of the loop

If there’s no result that’s been found under the cost limit without the fire at each point of the algorithm, you do do the recursive calls for the fire

Then once you’re back to the top level call, if there was a non-fire path you will get that result, if there wasn’t you will get that instead