| I imagine this may not be fixed, because if you have a lot of scouts and other ships, it may take too long every turn to not only calculate the optimal path, but do it for EVERY ship, taking into account the movements of EVERY OTHER ship as well for each calculation. I have no understanding of how the coding works, but I could imagine this would take up more time to calculate than is desired. |
Besides calculation time, the effort to program this sort of optimal search to handle varying ship speeds, sensor sizes, numbers of ships, etc would be quite considerable and likely not the effort.
I think a simpler solution would be for them to:
1) add a randomization factor to the exploration routines so they don't all pick the same spots to explore all the time
2) (more coding effort and calculation time cost) make exploring ships adjust their exploration heading every time they're about to move (ie: once every turn), so if their target area is already explored, they'd pick another target area.