Supposing I have 2 units made of 4 supporting elements and 6 assault elements, and one is assigned as support unit and one as assault unit, against one unit of 10 nondescript elements, here is the matching I'd like to have (I suppose here the assault elements can handle only 1 nondescript without needing reinforcements):
1 unit in support (all elements),4 supporting elements in and 6 assault elements matched against 1 element each.
That is a recursive approach in terms of code, which means it is small code, fast to write but maybe not fast to execute. In terms of simulation, I prefer this to a (8 supporting elements, 12 assault elements 2 vs 1 twice, and 1 vs 1 8 times) approach. It is less efficient but it represents better the fact that during war, you stick with units of your battalion, sometimes the next one, but a single battalion is not very often broken up into lots of different locations because they would be more efficient there: it would be very hard in terms of logistics and command line to reorganize an army that efficiently. (From my time in the army, I believe it would be really hard for officers).
1 unit in support (all elements),4 supporting elements in and 6 assault elements matched against 1 element each.
That is a recursive approach in terms of code, which means it is small code, fast to write but maybe not fast to execute. In terms of simulation, I prefer this to a (8 supporting elements, 12 assault elements 2 vs 1 twice, and 1 vs 1 8 times) approach. It is less efficient but it represents better the fact that during war, you stick with units of your battalion, sometimes the next one, but a single battalion is not very often broken up into lots of different locations because they would be more efficient there: it would be very hard in terms of logistics and command line to reorganize an army that efficiently. (From my time in the army, I believe it would be really hard for officers).
Comment