2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2016, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure, Markus Armbruster
6 * Empire 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 3 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, see <http://www.gnu.org/licenses/>.
21 * See files README, COPYING and CREDITS in the root of the source
22 * tree for related information and legal notices. It is expected
23 * that future projects/authors will amend these files as needed.
27 * nat.c: Accumulate tech, edu, research and happiness.
29 * Known contributors to this file:
32 * Markus Armbruster, 2006-2015
42 #include "prototypes.h"
47 * hap and edu avg mean that the weight on current happiness is
48 * (cur_hap * hap_avg + hap_prod * etu) / (hap_avg + etu);
50 * right now, happiness has 1 day (48 etu) average, prod of 10 from
51 * initial level of 0 yields (1) 1.42, (6) 6.03, (12) 8.42, (18) 9.37
53 * education has 4 day (192 etu) average, prod of 10 from initial
54 * level of 0 yields (1) 0.4, (6) 2.2, (12) 3.9, (18) 5.2.
57 static void share_incr(double *, double *);
60 * for values below the "easy level" values, production is
61 * as normal. For values above "easy", production gets harder
62 * based on an equation in "limit_level()" in update/nat.c.
63 * Basically, the smaller the the values for "level_log", the
64 * smaller return on investment above level_easy[] values.
67 * Damn! I hate this, but ...
68 * The values here for tech are *not* the real ones.
69 * They are changed later in the limit_level routine.
72 static float level_easy[4] = { 0.75, 0.75, 5.00, 5.00 };
73 static float level_log[4] = { 1.75, 2.00, 4.00, 6.00 };
75 float levels[MAXNOC][4];
78 * technique to limit the sharpers who turn entire countries
79 * into tech plants overnight...
83 logx(double d, double base)
87 return log10(d) / log10(base);
91 limit_level(double level, int type, int flag)
101 level_easy[0] = easy_tech;
102 level_log[0] = tech_log_base;
107 if (level > level_easy[type]) {
108 logbase = level_log[type];
109 easy = level_easy[type];
110 above_easy = level - easy;
112 above = above_easy / logx(logbase + above_easy, logbase);
114 above = logx(above_easy + 1.0, logbase);
117 return above < 0 ? easy : easy + above;
139 for (n = 0; NULL != (np = getnatp(n)); n++) {
140 grant_btus(np, game_reset_tick(&np->nat_access));
141 if (np->nat_stat < STAT_ACTIVE)
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(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;
180 wu(0, n, "total pop was %d, yielding %4.2f hap, %4.2f edu\n",
183 if (ally_factor > 0.0)
184 share_incr(res, tech);
186 memset(res, 0, sizeof(res));
187 memset(tech, 0, sizeof(tech));
189 for (n = 0; NULL != (np = getnatp(n)); n++) {
190 if (np->nat_stat < STAT_ACTIVE)
192 tlev = levels[n][NAT_TLEV];
193 rlev = levels[n][NAT_RLEV];
194 if (tech[n] != 0.0 || res[n] != 0.0) {
195 wu(0, n, "%5.4f technology (%5.4f + %5.4f), "
196 "%5.4f research (%5.4f + %5.4f) produced\n",
197 tlev + tech[n], tlev, tech[n],
198 rlev + res[n], rlev, res[n]);
200 wu(0, n, "%5.4f tech, %5.4f research produced\n", tlev, rlev);
204 np->nat_level[NAT_RLEV] += rlev;
206 np->nat_level[NAT_TLEV] += tlev;
207 if ((sea_money[n] != 0) || (air_money[n] != 0) ||
210 "Army delta $%d, Navy delta $%d, Air force delta $%d\n",
211 lnd_money[n], sea_money[n], air_money[n]);
212 wu(0, n, "money delta was $%d for this update\n",
213 np->nat_money - money[n]);
214 if (opt_LOSE_CONTACT) {
215 for (cn = 1; cn < MAXNOC; cn++) {
216 if ((cnp = getnatp(cn)) != NULL)
224 * find out everyones increment
227 share_incr(double *res, double *tech)
230 struct natstr *other;
236 for (i = 0; NULL != (np = getnatp(i)); i++) {
237 res[i] = tech[i] = 0.0;
238 if (np->nat_stat < STAT_SANCT || np->nat_stat == STAT_GOD)
241 for (j = 0; NULL != (other = getnatp(j)); j++) {
244 if (other->nat_stat != STAT_ACTIVE)
247 if (!getcontact(np, j))
250 if (!opt_ALL_BLEED) {
251 if (relations_with(i, j) != ALLIED)
253 if (relations_with(j, i) != ALLIED)
255 res[i] += levels[j][NAT_RLEV];
256 tech[i] += levels[j][NAT_TLEV];
260 if (levels[j][NAT_TLEV] > 0.001) {
261 tech[i] += levels[j][NAT_TLEV];
264 if (levels[j][NAT_RLEV] > 0.001) {
265 res[i] += levels[j][NAT_RLEV];
271 res[i] /= rnc * ally_factor;
274 tech[i] /= tnc * ally_factor;