All translations

Jump to navigation Jump to search

Enter a message name below to show all available translations.

Message

Found one translation.

NameCurrent message text
 h English (en){| class="wikitable"
|- 
! Factor || Explaination || Example
|-
| Tribe of the attacker || Each tribe has different chiefs which have different minimum and maximum values. || 20-25 base loyalty
|-
| Randomness || Each chief has a minimum and maximum value of loyalty he can lower. The actual amount is purely random between those values. || e.g. 23 is selected by random
|-
| Big Parties on both sides || A big party of the attacking village increases the base loyalty lowering per chief by 5 while a big party of the defending village decreases the base loyalty by the same amount. || +5 for attacker (big party) = 28<br />&plusmn;0 for defender (no parties) = 28
|-
| Amount of surviving chiefs || The base loyalty is multiplied by the amount of surviving chiefs. || 2 * 28 = 56
|-
| Brewery || A running brewery party in the account of the attacker halfes the effectiveness of all surviving chiefs. || 56 / 2 = 28
|-
| Morale || If the attacker has more population than the defender, chiefs only <math>(\frac{defender\ population}{attacker\ population})^{0.2}</math> effective, up to a malus of 33.3%. || 28 * (1000/3000)^(0.2) &asymp; 22.5
|}