Comment 8 for bug 573863

The map functions do not work this way. You can search the whole map for areas the player can not see that that is ineffective. So you search for unseen nodes in an area (a certain radius) around a node for black area. You mostly search in a radius around a node. Searching the whole map for something is too slow. This radius is just too small for some circumstances.

The scout have to rely on this information. They do not talk much. The scout have to ask. ;) "All the player can see" or not see in this case equals to searching the whole map and that is not necessary in this case. Actually the scout can know everything the player knows. It's only a question how far search the information.

As far as I know the scout keeps a list of interesting places to explore them later. But I do not know much about the scouting code. The problems with the scout are not how it is implemented but the parameters of this implementation. In my opinion both parameters (initial search range and scouting time) are to low for the scouting feature to be useful. It is more a question of adjusting these to improve the scouting feature.