2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2004, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 * See the "LEGAL", "LICENSE", "CREDITS" and "README" files for all the
23 * related information and legal notices. It is expected that any future
24 * projects/authors will amend these files as needed.
28 * nat.c: Accumulate tech, edu, research and happiness.
30 * Known contributors to this file:
49 * hap and edu avg mean that the weight on current happiness is
50 * (cur_hap * hap_avg + hap_prod * etu) / (hap_avg + etu);
52 * right now, happiness has 1 day (48 etu) average, prod of 10 from
53 * initial level of 0 yields (1) 1.42, (6) 6.03, (12) 8.42, (18) 9.37
55 * education has 4 day (192 etu) average, prod of 10 from initial
56 * level of 0 yields (1) 0.4, (6) 2.2, (12) 3.9, (18) 5.2.
59 static void share_incr(double *, double *);
62 * for values below the "easy level" values, production is
63 * as normal. For values above "easy", production gets harder
64 * based on an equation in "limit_level()" in update/nat.c.
65 * Basically, the smaller the the values for "level_log", the
66 * smaller return on investment above level_easy[] values.
69 * Damn! I hate this, but ...
70 * The values here for tech are *not* the real ones.
71 * They are changed later in the limit_level routine.
74 float level_easy[4] = { 0.75, 0.75, 5.00, 5.00 };
75 float level_log[4] = { 1.75, 2.00, 4.00, 6.00 };
77 float levels[MAXNOC][4];
80 * technique to limit the sharpers who turn entire countries
81 * into tech plants overnight...
85 logx(double d, double base)
89 return log10(d) / log10(base);
93 limit_level(double level, int type, int flag)
103 level_easy[0] = easy_tech;
104 level_log[0] = tech_log_base;
109 if (level > level_easy[type]) {
110 logbase = level_log[type];
111 easy = level_easy[type];
112 above_easy = level - easy;
114 above = above_easy / logx(logbase + above_easy, logbase);
116 above = logx(above_easy + 1.0, logbase);
119 return ((above) < 0) ? easy : (easy + above);
140 for (n = 0; NULL != (np = getnatp(n)); n++) {
141 if ((np->nat_stat & STAT_NORM) == 0)
144 * hap_edu: the more education people have, the
145 * more happiness they want.
147 hap_edu = np->nat_level[NAT_ELEV];
148 hap_edu = 1.5 - ((hap_edu + 10.0) / (hap_edu + 20.0));
151 * get per-population happiness and education
152 * see what the total per-civilian production is
153 * for this time period.
155 hap = levels[n][NAT_HLEV] * hap_edu * hap_cons /
157 edu = levels[n][NAT_ELEV] * edu_cons / ((float)pop * etu);
158 wu((natid)0, n, "%3.0f happiness, %3.0f education produced\n",
159 levels[n][NAT_HLEV], levels[n][NAT_ELEV]);
160 hap = limit_level(hap, NAT_HLEV, 1);
161 edu = limit_level(edu, NAT_ELEV, 1);
163 * change the "moving average"...old happiness and
164 * education levels are weighted heavier than current
167 newvalue = (np->nat_level[NAT_HLEV] * hap_avg + hap * etu) /
169 np->nat_level[NAT_HLEV] = newvalue;
170 newvalue = (np->nat_level[NAT_ELEV] * edu_avg + edu * etu) /
172 np->nat_level[NAT_ELEV] = newvalue;
174 * limit tech/research production
176 levels[n][NAT_TLEV] =
177 limit_level(levels[n][NAT_TLEV] / 1, NAT_TLEV, 0) * 1;
178 levels[n][NAT_RLEV] =
179 limit_level(levels[n][NAT_RLEV] / 1, NAT_RLEV, 0) * 1;
181 "total pop is %ld, yielding %4.2f hap, %4.2f edu\n",
184 if (ally_factor > 0.0)
185 share_incr(res, tech);
187 memset(res, 0, sizeof(res));
188 memset(tech, 0, sizeof(tech));
190 for (n = 0; NULL != (np = getnatp(n)); n++) {
191 if ((np->nat_stat & STAT_NORM) == 0)
193 tlev = levels[n][NAT_TLEV];
194 rlev = levels[n][NAT_RLEV];
195 if (tech[n] != 0.0 || res[n] != 0.0) {
197 "%5.4f technology (%5.4f + %5.4f), ",
198 tlev + tech[n], tlev, tech[n]);
200 "%5.4f research (%5.4f + %5.4f) produced\n",
201 rlev + res[n], rlev, res[n]);
204 "%5.4f tech, %5.4f research produced\n", tlev, rlev);
208 np->nat_level[NAT_RLEV] += rlev;
210 np->nat_level[NAT_TLEV] += tlev;
211 if ((sea_money[n] != 0) || (air_money[n] != 0) ||
214 "Army delta $%ld, Navy delta $%ld, Air force delta $%ld\n",
215 lnd_money[n], sea_money[n], air_money[n]);
216 wu((natid)0, n, "money delta was $%ld for this update\n",
217 np->nat_money - money[n]);
218 if (opt_LOSE_CONTACT) {
219 for (cn = 0; cn <= MAXNOC; cn++) {
220 cont = getcontact(np, cn);
222 logerror("country %d at level %d with country %d.\n",
224 setcont(n, cn, cont - 1);
232 * find out everyones increment
235 share_incr(double *res, double *tech)
238 struct natstr *other;
244 for (i = 0; NULL != (np = getnatp(i)); i++) {
245 res[i] = tech[i] = 0.0;
246 if ((np->nat_stat & STAT_INUSE) == 0)
248 if (np->nat_stat & STAT_GOD)
250 if (np->nat_stat == VIS)
253 for (j = 0; NULL != (other = getnatp(j)); j++) {
256 if (other->nat_stat & STAT_GOD)
258 if (other->nat_stat == VIS)
260 if ((other->nat_stat & STAT_INUSE) == 0)
263 if (!getcontact(np, j))
266 if (!opt_ALL_BLEED) {
267 if (getrel(np, j) != ALLIED)
269 if (getrel(other, i) != ALLIED)
271 res[i] += levels[j][NAT_RLEV];
272 tech[i] += levels[j][NAT_TLEV];
276 if (levels[j][NAT_TLEV] > 0.001) {
277 tech[i] += levels[j][NAT_TLEV];
280 if (levels[j][NAT_RLEV] > 0.001) {
281 res[i] += levels[j][NAT_RLEV];
286 if (rnc == 0 && tnc == 0)
289 res[i] /= rnc * ally_factor;
292 tech[i] /= tnc * ally_factor;
294 /* logerror("Country #%d gets %g res from %d allies, %g tech from %d allies", i, res[i], rnc, tech[i], tnc);*/