| 1 |
/* |
| 2 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
| 3 |
* |
| 4 |
* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 |
* Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
| 6 |
* Copyright (©) 1992 Frank Tore Johansen |
| 7 |
* |
| 8 |
* Deliantra is free software: you can redistribute it and/or modify it under |
| 9 |
* the terms of the Affero GNU General Public License as published by the |
| 10 |
* Free Software Foundation, either version 3 of the License, or (at your |
| 11 |
* option) any later version. |
| 12 |
* |
| 13 |
* This program is distributed in the hope that it will be useful, |
| 14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 16 |
* GNU General Public License for more details. |
| 17 |
* |
| 18 |
* You should have received a copy of the Affero GNU General Public License |
| 19 |
* and the GNU General Public License along with this program. If not, see |
| 20 |
* <http://www.gnu.org/licenses/>. |
| 21 |
* |
| 22 |
* The authors can be reached via e-mail to <support@deliantra.net> |
| 23 |
*/ |
| 24 |
|
| 25 |
#include <stdio.h> |
| 26 |
#include <global.h> |
| 27 |
|
| 28 |
sint64 levels[MAXNUMLEVELS]; |
| 29 |
|
| 30 |
static const float exp_att_mult[NROFATTACKS + 2] = { |
| 31 |
0.0, /* AT_PHYSICAL */ |
| 32 |
0.0, /* AT_MAGIC */ |
| 33 |
0.0, /* AT_FIRE */ |
| 34 |
0.0, /* AT_ELECTRICITY */ |
| 35 |
0.0, /* AT_COLD */ |
| 36 |
0.0, /* AT_WATER *//*AT_CONFUSION! */ |
| 37 |
0.4, /* AT_ACID */ |
| 38 |
1.5, /* AT_DRAIN */ |
| 39 |
0.0, /* AT_WEAPONMAGIC */ |
| 40 |
0.1, /* AT_GHOSTHIT */ |
| 41 |
0.3, /* AT_POISON */ |
| 42 |
0.2, /* AT_DISEASE */ |
| 43 |
0.3, /* AT_PARALYZE */ |
| 44 |
0.0, /* AT_TURN_UNDEAD */ |
| 45 |
0.0, /* AT_FEAR */ |
| 46 |
0.0, /* AT_CANCELLATION */ |
| 47 |
0.0, /* AT_DEPLETE */ |
| 48 |
0.0, /* AT_DEATH */ |
| 49 |
0.0, /* AT_CHAOS */ |
| 50 |
0.0 /* AT_COUNTERSPELL */ |
| 51 |
}; |
| 52 |
|
| 53 |
static const float exp_prot_mult[NROFATTACKS + 2] = { |
| 54 |
0.4, /* AT_PHYSICAL */ |
| 55 |
0.5, /* AT_MAGIC */ |
| 56 |
0.1, /* AT_FIRE */ |
| 57 |
0.1, /* AT_ELECTRICITY */ |
| 58 |
0.1, /* AT_COLD */ |
| 59 |
0.1, /* AT_WATER */ |
| 60 |
0.1, /* AT_ACID */ |
| 61 |
0.1, /* AT_DRAIN */ |
| 62 |
0.1, /* AT_WEAPONMAGIC */ |
| 63 |
0.1, /* AT_GHOSTHIT */ |
| 64 |
0.1, /* AT_POISON */ |
| 65 |
0.1, /* AT_DISEASE */ |
| 66 |
0.1, /* AT_PARALYZE */ |
| 67 |
0.1, /* AT_TURN_UNDEAD */ |
| 68 |
0.1, /* AT_FEAR */ |
| 69 |
0.0, /* AT_CANCELLATION */ |
| 70 |
0.0, /* AT_DEPLETE */ |
| 71 |
0.0, /* AT_DEATH */ |
| 72 |
0.0, /* AT_CHAOS */ |
| 73 |
0.0 /* AT_COUNTERSPELL */ |
| 74 |
}; |
| 75 |
|
| 76 |
/* |
| 77 |
* Returns true if the monster specified has any innate abilities. |
| 78 |
*/ |
| 79 |
static int |
| 80 |
has_ability (const object *ob) |
| 81 |
{ |
| 82 |
for (object *tmp = ob->inv; tmp; tmp = tmp->below) |
| 83 |
if (tmp->type == SPELL || tmp->type == SPELLBOOK) |
| 84 |
return true; |
| 85 |
|
| 86 |
return false; |
| 87 |
} |
| 88 |
|
| 89 |
/* |
| 90 |
* new_exp() is an alternative way to calculate experience based |
| 91 |
* on the ability of a monster. |
| 92 |
* It's far from perfect, and doesn't consider everything which |
| 93 |
* can be considered, thus it's only used in debugging. |
| 94 |
* this is only used with one of the dumpflags, |
| 95 |
* and not anyplace in the code. |
| 96 |
*/ |
| 97 |
int |
| 98 |
new_exp (const object *ob) |
| 99 |
{ |
| 100 |
double att_mult, prot_mult, spec_mult; |
| 101 |
double exp; |
| 102 |
int i; |
| 103 |
long mask = 1; |
| 104 |
|
| 105 |
att_mult = prot_mult = spec_mult = 1.0; |
| 106 |
for (i = 0; i < NROFATTACKS; i++) |
| 107 |
{ |
| 108 |
mask = 1 << i; |
| 109 |
att_mult += (exp_att_mult[i] * ((ob->attacktype & mask) != 0)); |
| 110 |
/* We multiply & then divide to prevent roundoffs on the floats. |
| 111 |
* the doubling is to take into account the table and resistances |
| 112 |
* are lower than they once were. |
| 113 |
*/ |
| 114 |
prot_mult += (exp_prot_mult[i] * 200 * ob->resist[i]) / 100.0; |
| 115 |
} |
| 116 |
|
| 117 |
spec_mult += (0.3 * (ob->flag [FLAG_SEE_INVISIBLE] != 0)) + |
| 118 |
(0.5 * (ob->flag [FLAG_SPLITTING] != 0)) + |
| 119 |
(0.3 * (ob->flag [FLAG_HITBACK] != 0)) + |
| 120 |
(0.1 * (ob->flag [FLAG_REFL_MISSILE] != 0)) + |
| 121 |
(0.3 * (ob->flag [FLAG_REFL_SPELL] != 0)) + |
| 122 |
(1.0 * (ob->flag [FLAG_NO_MAGIC] != 0)) + |
| 123 |
(0.1 * (ob->flag [FLAG_PICK_UP] != 0)) + |
| 124 |
(0.1 * (ob->flag [FLAG_USE_SCROLL] != 0)) + |
| 125 |
(0.2 * (ob->flag [FLAG_USE_RANGE] != 0)) + (0.1 * (ob->flag [FLAG_USE_BOW] != 0)); |
| 126 |
|
| 127 |
exp = (ob->stats.maxhp < 5) ? 5 : ob->stats.maxhp; |
| 128 |
exp *= (ob->flag [FLAG_CAST_SPELL] && has_ability (ob)) ? (40 + (ob->stats.maxsp > 80 ? 80 : ob->stats.maxsp)) / 40 : 1; |
| 129 |
exp *= (80.0 / (70.0 + ob->stats.wc)) * (80.0 / (70.0 + ob->stats.ac)) * (50.0 + ob->stats.dam) / 50.0; |
| 130 |
exp *= att_mult * prot_mult * spec_mult; |
| 131 |
exp *= 2.0 / (2.0 - min (ob->speed, 0.95)); |
| 132 |
exp *= (20.0 + ob->stats.Con) / 20.0; |
| 133 |
if (ob->flag [FLAG_STAND_STILL]) |
| 134 |
exp /= 2; |
| 135 |
|
| 136 |
return exp; |
| 137 |
} |
| 138 |
|
| 139 |
//TODO: binary search... |
| 140 |
int |
| 141 |
exp_to_level (sint64 exp) |
| 142 |
{ |
| 143 |
for (int i = 1; i <= settings.max_level; i++) |
| 144 |
if (levels [i] > exp) |
| 145 |
return i - 1; |
| 146 |
|
| 147 |
return settings.max_level; |
| 148 |
} |
| 149 |
|
| 150 |
sint64 |
| 151 |
level_to_min_exp (int level) |
| 152 |
{ |
| 153 |
if (level <= 0) |
| 154 |
return 0; |
| 155 |
else |
| 156 |
return levels [min (level, settings.max_level)]; |
| 157 |
} |
| 158 |
|
| 159 |
/* This loads the experience table from the exp_table |
| 160 |
* file. This tends to exit on any errors, since it |
| 161 |
* populates the table as it goes along, so if there |
| 162 |
* are errors, the table is likely in an inconsistent |
| 163 |
* state. |
| 164 |
*/ |
| 165 |
void |
| 166 |
init_experience () |
| 167 |
{ |
| 168 |
int lastlevel = 0; |
| 169 |
sint64 lastexp = -1; |
| 170 |
|
| 171 |
object_thawer thawer (settings.datadir, "exp_table"); |
| 172 |
|
| 173 |
if (!thawer) |
| 174 |
{ |
| 175 |
LOG (llevError, "unable to parse experience table file"); |
| 176 |
return; |
| 177 |
} |
| 178 |
|
| 179 |
if (thawer.kw != KW_max_level) |
| 180 |
{ |
| 181 |
thawer.parse_error ("experience table file"); |
| 182 |
return; |
| 183 |
} |
| 184 |
|
| 185 |
thawer.get (settings.max_level); |
| 186 |
|
| 187 |
sint64 newlevels [MAXNUMLEVELS]; |
| 188 |
|
| 189 |
while (thawer.next_line ()) |
| 190 |
{ |
| 191 |
sint64 tmpexp; |
| 192 |
thawer.get (tmpexp); |
| 193 |
|
| 194 |
/* Do some sanity checking - if value is bogus, just exit because |
| 195 |
* the table otherwise is probably in an inconsistent state |
| 196 |
*/ |
| 197 |
if (tmpexp <= lastexp) |
| 198 |
{ |
| 199 |
LOG (llevError, "Experience for level %d is lower than previous level (%" PRId64 " <= %" PRId64 ")\n", lastlevel + 1, tmpexp, lastexp); |
| 200 |
return; |
| 201 |
} |
| 202 |
|
| 203 |
lastlevel++; |
| 204 |
|
| 205 |
if (lastlevel > settings.max_level) |
| 206 |
{ |
| 207 |
LOG (llevError, "Too many levels specified in table (%d > %d)\n", lastlevel, settings.max_level); |
| 208 |
exit (1); |
| 209 |
} |
| 210 |
|
| 211 |
newlevels [lastlevel] = tmpexp; |
| 212 |
lastexp = tmpexp; |
| 213 |
} |
| 214 |
|
| 215 |
if (lastlevel != settings.max_level && lastlevel != 0) |
| 216 |
{ |
| 217 |
LOG (llevError, "Warning: exp_table does not have %d entries (%d)\n", settings.max_level, lastlevel); |
| 218 |
return; |
| 219 |
} |
| 220 |
|
| 221 |
memcpy (levels, newlevels, sizeof (levels)); |
| 222 |
} |
| 223 |
|
