Hey guys!,
So, I'm basically working on an explorer right now.
It should, as the name suggests, explore the entire thing, the most efficient way possible.
- Your character has vision around you, of, 10x10.
- The map is much bigger, 100x100.
- However, it can't just go straight from a corner to another, because: The tiles can be an occupied, or un-occupied one.
- You can add weights to the tiles, so feel free to use this in your advantage (let's say, adding an extra weight to a visited tile so you can compare visited against non-visited ones).
- You can use the Pathfinder I'm using, based on the A* algorithm.
So, I could be wrong, but by basic logic, I assumed that the "fastest way" to explore the entire thing, is answering the question "What is the nearest tile that I can walk in, that is not occupied and that can reveal as much fog-of-war (unvisited tile) as possible?"...
My questions are:
- 1) Is my question correct? is that really the best way to explore the entire map?
- 2) If so, what's the best way to know "which is the tile that could reveal the most fog of war"?
Once I get the tile that reveals the most fog of war possible, then I just throw the pathfinder to it.
But I'm having problems doing a good way to achieve that :'(
I hope you guys can help me on this one!
Thank you