2 hours ago, LorenzoGatti said:

You appear to be discussing exploration of the static features of the map, not fog of war. Fog of war returns as soon as no unit is watching a certain part of the map, making most algorithms discussed so far pointless (for example, there's going to be a single connected component of fog, with a hole around your agent that corresponds to their field of view) and a single "explorer" completely inadequate.

Hey!

Whatever the writing mistakes there could be, I think the point was very clear for 99.99% of the people that answered this post, the algorithm's goal is to explore the entire array of 100x100 in the possible efficient way, having in consideration that there are obstacles (you have the A* function for this) and fog of war (which means that you can't simply setup the waypoints so you basically have to explore the entire thing)....