 |
|
Valant
|
|
This program was made by Xerxes314 on the Civ Fanatics Forum. And after bonking heads on some values and helping him on exact binomial probability calculations.....his latest program does a DAMN fine job.
He be da link:
http://www.columbia.edu/~sdc2002/civulator.html
|
|
|  |
 |
|
Valant
|
|
Zoomed of the first page....well going to try 1 shameless bump.
|
|
|  |
 |
|
Jeje2
|
 |
Espoo, Finland
Apr 1999 time: 07:16
|
|
Can on see the equqations anywhere?
(Would be nice to have them in printed version or something...
Locked at sourcecode, but Javascript not Jeje2's skill)
Last edited by Jeje2 on 05-11-2001 at 14:21
|
|
|  |
 |
|
Valant
|
|
Jeje2:
Okay you asked for it. The program uses the exact binomial probability equation calculator. This equation is
P(x) = (n over x factorial) * p^x * q^(n-x)
Where
n = number of trials
p = probability of success
q = 1- p
x = number of successes in n trials
n-x = number of failures in n trials
So
n = attackers HP + defenders HP - 1
p = attackers attack power / (attackers attack power + defenders defensive power)
* note do not forget to add in the defenders defensive bonuses it its attack power before plugging it into p*
q = 1 - p
x = is a variable that ranges from a min of the defenders HP value to a max of n
n-x = is a variable that ranges from a min of zero to a max of (attackers HP - 1)
The program then goes through and then determines that out of n trials (max number of tuns in a battle before a unit dies), the attacker will win at least the defenders HP number of turns.
Trust me, its quite accurate.
|
|
|  |
All times are GMT. The time now is 05:16. Apolyton Time is 00:16. |
top of page
|
| archivepost |
|
Forum Rules:
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts
|
HTML code is ON
vB code is ON
Smilies are ON
[IMG] code is ON
|
|
|
|
|
|