OK - still confused.
Now the winner's surviving power is determined. This is simply done by dividing the winner's least power-up-against value by the second least power-up-against value, subtracting this value from 1 and multiplying the result with the total power of the winner's army.
Blue sentence gives me headache - least...second least?
We divide the bomber's value of 3 by the trooper and tanks value of 3.75, which results in 0.8. Subtracted from 1 and multiplied by 3, the winner's surviving power in our earlier example is 0.6.
To me it seems you just divided loser's power by winner's power.
3/3,75Let's assume we had two troopers and two tanks versus this bomber. While troopers and tanks are still up against a power of 3.75, the bomber's power-up-against value is now 6 (2 * 1 * 1.5 + 2 * 2 * 0.75). This means the bomber loses the battle, and, after applying the above calculations, the winner's surviving power results in 2.25.
Here I see the same - loser's power divided by winner's power and so on --> 6*(1 -
3,75/6)
As the troopers were up against a power of only 1/3 * 2.25 = 0.75 and the tanks against 2/3 * 4.5 = 3, we're aiming for a trooper to tank return ratio of 4:1; but with only two troopers fighting for us in the battle, we simply buy both, reducing our budget from 2.25 to 0.25. This result is neither negative nor zero, so we also get a tank back (budget goes from 0.25 to -1.75) and now the algorithm terminates.
That is understandable.
So did I understand this correctly or just managed to make up fitting equations?
Also
If both power-up-against values are identical, the winner's power-up-against value is scaled down by a small fraction before the division.
Thought in this case both armies are destroyed?