2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2010, 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 files README, COPYING and CREDITS in the root of the source
23 * tree for related information and legal notices. It is expected
24 * that future projects/authors will amend these files as needed.
28 * nat.c: Accumulate tech, edu, research and happiness.
30 * Known contributors to this file:
44 * hap and edu avg mean that the weight on current happiness is
45 * (cur_hap * hap_avg + hap_prod * etu) / (hap_avg + etu);
47 * right now, happiness has 1 day (48 etu) average, prod of 10 from
48 * initial level of 0 yields (1) 1.42, (6) 6.03, (12) 8.42, (18) 9.37
50 * education has 4 day (192 etu) average, prod of 10 from initial
51 * level of 0 yields (1) 0.4, (6) 2.2, (12) 3.9, (18) 5.2.
54 static void share_incr(double *, double *);
57 * for values below the "easy level" values, production is
58 * as normal. For values above "easy", production gets harder
59 * based on an equation in "limit_level()" in update/nat.c.
60 * Basically, the smaller the the values for "level_log", the
61 * smaller return on investment above level_easy[] values.
64 * Damn! I hate this, but ...
65 * The values here for tech are *not* the real ones.
66 * They are changed later in the limit_level routine.
69 static float level_easy[4] = { 0.75, 0.75, 5.00, 5.00 };
70 static float level_log[4] = { 1.75, 2.00, 4.00, 6.00 };
72 float levels[MAXNOC][4];
75 * technique to limit the sharpers who turn entire countries
76 * into tech plants overnight...
80 logx(double d, double base)
84 return log10(d) / log10(base);
88 limit_level(double level, int type, int flag)
98 level_easy[0] = easy_tech;
99 level_log[0] = tech_log_base;
104 if (level > level_easy[type]) {
105 logbase = level_log[type];
106 easy = level_easy[type];
107 above_easy = level - easy;
109 above = above_easy / logx(logbase + above_easy, logbase);
111 above = logx(above_easy + 1.0, logbase);
114 return above < 0 ? easy : easy + above;
136 for (n = 0; NULL != (np = getnatp(n)); n++) {
137 grant_btus(np, game_reset_tick(&np->nat_access));
138 if (np->nat_stat < STAT_ACTIVE)
141 * hap_edu: the more education people have, the
142 * more happiness they want.
144 hap_edu = np->nat_level[NAT_ELEV];
145 hap_edu = 1.5 - ((hap_edu + 10.0) / (hap_edu + 20.0));
148 * get per-population happiness and education
149 * see what the total per-civilian production is
150 * for this time period.
152 hap = levels[n][NAT_HLEV] * hap_edu * hap_cons /
154 edu = levels[n][NAT_ELEV] * edu_cons / ((float)pop * etu);
155 wu(0, n, "%3.0f happiness, %3.0f education produced\n",
156 levels[n][NAT_HLEV], levels[n][NAT_ELEV]);
157 hap = limit_level(hap, NAT_HLEV, 1);
158 edu = limit_level(edu, NAT_ELEV, 1);
160 * change the "moving average"...old happiness and
161 * education levels are weighted heavier than current
164 newvalue = (np->nat_level[NAT_HLEV] * hap_avg + hap * etu) /
166 np->nat_level[NAT_HLEV] = newvalue;
167 newvalue = (np->nat_level[NAT_ELEV] * edu_avg + edu * etu) /
169 np->nat_level[NAT_ELEV] = newvalue;
171 * limit tech/research production
173 levels[n][NAT_TLEV] =
174 limit_level(levels[n][NAT_TLEV] / 1, NAT_TLEV, 0) * 1;
175 levels[n][NAT_RLEV] =
176 limit_level(levels[n][NAT_RLEV] / 1, NAT_RLEV, 0) * 1;
177 wu(0, n, "total pop was %ld, yielding %4.2f hap, %4.2f edu\n",
180 if (ally_factor > 0.0)
181 share_incr(res, tech);
183 memset(res, 0, sizeof(res));
184 memset(tech, 0, sizeof(tech));
186 for (n = 0; NULL != (np = getnatp(n)); n++) {
187 if (np->nat_stat < STAT_ACTIVE)
189 tlev = levels[n][NAT_TLEV];
190 rlev = levels[n][NAT_RLEV];
191 if (tech[n] != 0.0 || res[n] != 0.0) {
192 wu(0, n, "%5.4f technology (%5.4f + %5.4f), ",
193 tlev + tech[n], tlev, tech[n]);
194 wu(0, n, "%5.4f research (%5.4f + %5.4f) produced\n",
195 rlev + res[n], rlev, res[n]);
197 wu(0, n, "%5.4f tech, %5.4f research produced\n", tlev, rlev);
201 np->nat_level[NAT_RLEV] += rlev;
203 np->nat_level[NAT_TLEV] += tlev;
204 if ((sea_money[n] != 0) || (air_money[n] != 0) ||
207 "Army delta $%ld, Navy delta $%ld, Air force delta $%ld\n",
208 lnd_money[n], sea_money[n], air_money[n]);
209 wu(0, n, "money delta was $%ld for this update\n",
210 np->nat_money - money[n]);
211 if (opt_LOSE_CONTACT) {
212 for (cn = 1; cn < MAXNOC; cn++) {
213 if ((cnp = getnatp(cn)) != NULL)
221 * find out everyones increment
224 share_incr(double *res, double *tech)
227 struct natstr *other;
233 for (i = 0; NULL != (np = getnatp(i)); i++) {
234 res[i] = tech[i] = 0.0;
235 if (np->nat_stat < STAT_SANCT || np->nat_stat == STAT_GOD)
238 for (j = 0; NULL != (other = getnatp(j)); j++) {
241 if (other->nat_stat != STAT_ACTIVE)
244 if (!getcontact(np, j))
247 if (!opt_ALL_BLEED) {
248 if (relations_with(i, j) != ALLIED)
250 if (relations_with(j, i) != ALLIED)
252 res[i] += levels[j][NAT_RLEV];
253 tech[i] += levels[j][NAT_TLEV];
257 if (levels[j][NAT_TLEV] > 0.001) {
258 tech[i] += levels[j][NAT_TLEV];
261 if (levels[j][NAT_RLEV] > 0.001) {
262 res[i] += levels[j][NAT_RLEV];
268 res[i] /= rnc * ally_factor;
271 tech[i] /= tnc * ally_factor;