KaNick
Deity
@teturkhan, I'm not sure lets take a poll

There are numerous algorithms for each bomber to go through each turn for every tile while the AI is at war. If the AI has 20 bombers with, say, a range of 20, that means that the AI has to run however many processes for 400 tiles 20 times, for a total of 8000 times. Depending on what has to be done for each tile, those 8000 times can be pretty evil.Originally posted by Kilroy
Can someone explain to me why bomber range has anything to do with pathfinding? The bomber isn't actually traveling to the square to drop bombs - it just appears there. I can see how there might be difficulty in evaluating all the units but that does NOT increase exponentially with distance.
Originally posted by Trip
There are numerous algorithms for each bomber to go through each turn for every tile while the AI is at war. If the AI has 20 bombers with, say, a range of 20, that means that the AI has to run however many processes for 400 tiles 20 times, for a total of 8000 times. Depending on what has to be done for each tile, those 8000 times can be pretty evil.
What they mean about the exponential increase is that, say, for 20 tile range, you have 8000 tiles. For 21 range, you have 8400. Not exponential, but certainly a lot more than before.
Of course, that's just a rough explanation, so don't go into all sorts of logarithmic details, etc., I'm just trying to prove a point.![]()
To be honest, I'm not sure what they did. If they do it exponentially, then it will be a lot easier on them, but makes machines crawl to a standstill the more things they have to compute. If they do it the way I described, it's a lot more work for them, but possible up to a much higher number. Since they haven't changed it already, I'm guessing they went with the former option.Originally posted by Kilroy
Yeah I know. The size of the computation only goes up as O(n^2). Quite different than an exponential increase. For a range of, for example, 12 squares the number of calculations for an O(e^n) calc is 1000 times greater than for an O(n^2) calc. For a range of 50, the difference between the number of calcs for each is around 10^18.
So, there is a huge-ass difference between what was said earlier and what you just said. Big enough to make a difference in whether an increased range could be implemented. In other words, if the calc is exponential, we're screwed. If it's n^2, I don't see what the problem is.
Originally posted by Tassadar
My question now is, if an ICBM can target anything on the map why a bomber wouldnt be able too ?
Originally posted by Tassadar
My question now is, if an ICBM can target anything on the map why a bomber wouldnt be able too ?