1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | * it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * (at your option) any later version. |
11 | * (at your option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
… | |
… | |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * |
20 | * |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
22 | */ |
23 | |
23 | |
24 | #include <global.h> |
24 | #include <global.h> |
25 | #include <sproto.h> |
25 | #include <sproto.h> |
26 | #include <spells.h> |
26 | #include <spells.h> |
… | |
… | |
35 | * set to sane values. |
35 | * set to sane values. |
36 | */ |
36 | */ |
37 | object * |
37 | object * |
38 | check_enemy (object *npc, rv_vector * rv) |
38 | check_enemy (object *npc, rv_vector * rv) |
39 | { |
39 | { |
40 | |
|
|
41 | /* if this is pet, let him attack the same enemy as his owner |
40 | /* if this is pet, let him attack the same enemy as his owner |
42 | * TODO: when there is no ower enemy, try to find a target, |
41 | * TODO: when there is no ower enemy, try to find a target, |
43 | * which CAN attack the owner. */ |
42 | * which CAN attack the owner. */ |
44 | if ((npc->attack_movement & HI4) == PETMOVE) |
43 | if ((npc->attack_movement & HI4) == PETMOVE) |
45 | { |
44 | { |
… | |
… | |
197 | /* we check our old enemy. */ |
196 | /* we check our old enemy. */ |
198 | if (!(tmp = check_enemy (npc, rv))) |
197 | if (!(tmp = check_enemy (npc, rv))) |
199 | { |
198 | { |
200 | if (attacker) /* if we have an attacker, check him */ |
199 | if (attacker) /* if we have an attacker, check him */ |
201 | { |
200 | { |
202 | /* TODO: thats not finished */ |
201 | /* TODO: that's not finished */ |
203 | /* we don't want a fight evil vs evil or good against non evil */ |
202 | /* we don't want a fight evil vs evil or good against non evil */ |
204 | |
203 | |
205 | if (QUERY_FLAG (npc, FLAG_NEUTRAL) || QUERY_FLAG (attacker, FLAG_NEUTRAL) || /* neutral */ |
204 | if (QUERY_FLAG (npc, FLAG_NEUTRAL) || QUERY_FLAG (attacker, FLAG_NEUTRAL) || /* neutral */ |
206 | (QUERY_FLAG (npc, FLAG_FRIENDLY) && QUERY_FLAG (attacker, FLAG_FRIENDLY)) || |
205 | (QUERY_FLAG (npc, FLAG_FRIENDLY) && QUERY_FLAG (attacker, FLAG_FRIENDLY)) || |
207 | (!QUERY_FLAG (npc, FLAG_FRIENDLY) && (!QUERY_FLAG (attacker, FLAG_FRIENDLY) && attacker->type != PLAYER))) |
206 | (!QUERY_FLAG (npc, FLAG_FRIENDLY) && (!QUERY_FLAG (attacker, FLAG_FRIENDLY) && attacker->type != PLAYER))) |
208 | CLEAR_FLAG (npc, FLAG_SLEEP); /* skip it, but lets wakeup */ |
207 | CLEAR_FLAG (npc, FLAG_SLEEP); /* skip it, but lets wakeup */ |
209 | else if (on_same_map (npc, attacker)) /* thats the only thing we must know... */ |
208 | else if (on_same_map (npc, attacker)) /* that's the only thing we must know... */ |
210 | { |
209 | { |
211 | CLEAR_FLAG (npc, FLAG_SLEEP); /* well, NOW we really should wake up! */ |
210 | CLEAR_FLAG (npc, FLAG_SLEEP); /* well, NOW we really should wake up! */ |
212 | npc->enemy = attacker; |
211 | npc->enemy = attacker; |
213 | return attacker; /* yes, we face our attacker! */ |
212 | return attacker; /* yes, we face our attacker! */ |
214 | } |
213 | } |
… | |
… | |
231 | * Currently, this is only called from move_monster, and |
230 | * Currently, this is only called from move_monster, and |
232 | * if enemy is set, then so should be rv. |
231 | * if enemy is set, then so should be rv. |
233 | * returns 1 if the monster should wake up, 0 otherwise. |
232 | * returns 1 if the monster should wake up, 0 otherwise. |
234 | */ |
233 | */ |
235 | int |
234 | int |
236 | check_wakeup (object *op, object *enemy, rv_vector * rv) |
235 | check_wakeup (object *op, object *enemy, rv_vector *rv) |
237 | { |
236 | { |
238 | int radius = op->stats.Wis > MIN_MON_RADIUS ? op->stats.Wis : MIN_MON_RADIUS; |
|
|
239 | |
|
|
240 | /* Trim work - if no enemy, no need to do anything below */ |
237 | /* Trim work - if no enemy, no need to do anything below */ |
241 | if (!enemy) |
238 | if (!enemy) |
242 | return 0; |
239 | return 0; |
243 | |
240 | |
|
|
241 | if (!op->flag [FLAG_SLEEP]) |
|
|
242 | return 1; |
|
|
243 | |
|
|
244 | int radius = max (op->stats.Wis, MIN_MON_RADIUS); |
|
|
245 | |
|
|
246 | if (op->flag [FLAG_BLIND]) |
244 | /* blinded monsters can only find nearby objects to attack */ |
247 | /* blinded monsters can only find nearby objects to attack */ |
245 | if (QUERY_FLAG (op, FLAG_BLIND)) |
|
|
246 | radius = MIN_MON_RADIUS; |
248 | radius = MIN_MON_RADIUS; |
247 | |
249 | else if (op->map |
|
|
250 | && !enemy->invisible |
|
|
251 | && !stand_in_light (enemy) |
|
|
252 | && (!op->flag[FLAG_SEE_IN_DARK] || !op->flag [FLAG_SEE_INVISIBLE])) |
248 | /* This covers the situation where the monster is in the dark |
253 | /* This covers the situation where the monster is in the dark |
249 | * and has an enemy. If the enemy has no carried light (or isnt |
254 | * and has an enemy. If the enemy has no carried light (or isnt |
250 | * glowing!) then the monster has trouble finding the enemy. |
255 | * glowing!) then the monster has trouble finding the enemy. |
251 | * Remember we already checked to see if the monster can see in |
256 | * Remember we already checked to see if the monster can see in |
252 | * the dark. */ |
257 | * the dark. */ |
|
|
258 | radius = min (radius, MIN_MON_RADIUS + MAX_DARKNESS - op->map->darklevel ()); |
253 | |
259 | |
254 | else if (op->map && op->map->darkness > 0 && enemy && !enemy->invisible && |
260 | if (enemy->flag [FLAG_STEALTH]) |
255 | !stand_in_light (enemy) && (!QUERY_FLAG (op, FLAG_SEE_IN_DARK) || !QUERY_FLAG (op, FLAG_SEE_INVISIBLE))) |
261 | radius = radius / 2 + 1; |
256 | { |
|
|
257 | int dark = radius / (op->map->darkness); |
|
|
258 | |
|
|
259 | radius = (dark > MIN_MON_RADIUS) ? (dark + 1) : MIN_MON_RADIUS; |
|
|
260 | } |
|
|
261 | else if (!QUERY_FLAG (op, FLAG_SLEEP)) |
|
|
262 | return 1; |
|
|
263 | |
262 | |
264 | /* enemy should already be on this map, so don't really need to check |
263 | /* enemy should already be on this map, so don't really need to check |
265 | * for that. |
264 | * for that. |
266 | */ |
265 | */ |
267 | if (rv->distance < (unsigned int) (QUERY_FLAG (enemy, FLAG_STEALTH) ? (radius / 2) + 1 : radius)) |
266 | if (rv->distance <= radius) |
268 | { |
267 | { |
269 | CLEAR_FLAG (op, FLAG_SLEEP); |
268 | CLEAR_FLAG (op, FLAG_SLEEP); |
270 | return 1; |
269 | return 1; |
271 | } |
270 | } |
|
|
271 | |
272 | return 0; |
272 | return 0; |
273 | } |
273 | } |
274 | |
274 | |
275 | int |
275 | int |
276 | move_randomly (object *op) |
276 | move_randomly (object *op) |
277 | { |
277 | { |
278 | int i; |
|
|
279 | |
|
|
280 | /* Give up to 15 chances for a monster to move randomly */ |
278 | /* Give up to 15 chances for a monster to move randomly */ |
281 | for (i = 0; i < 15; i++) |
279 | for (int i = 0; i < 15; i++) |
282 | { |
|
|
283 | if (move_object (op, rndm (8) + 1)) |
280 | if (move_object (op, rndm (8) + 1)) |
284 | return 1; |
281 | return 1; |
285 | } |
282 | |
286 | return 0; |
283 | return 0; |
287 | } |
284 | } |
288 | |
285 | |
289 | /* |
286 | /* |
290 | * Move-monster returns 1 if the object has been freed, otherwise 0. |
287 | * Move-monster returns 1 if the object has been freed, otherwise 0. |
… | |
… | |
313 | enemy->attacked_by = op; /* our ptr */ |
310 | enemy->attacked_by = op; /* our ptr */ |
314 | |
311 | |
315 | /* generate hp, if applicable */ |
312 | /* generate hp, if applicable */ |
316 | if (op->stats.Con > 0 && op->stats.hp < op->stats.maxhp) |
313 | if (op->stats.Con > 0 && op->stats.hp < op->stats.maxhp) |
317 | { |
314 | { |
318 | |
|
|
319 | /* last heal is in funny units. Dividing by speed puts |
315 | /* last heal is in funny units. Dividing by speed puts |
320 | * the regeneration rate on a basis of time instead of |
316 | * the regeneration rate on a basis of time instead of |
321 | * #moves the monster makes. The scaling by 8 is |
317 | * #moves the monster makes. The scaling by 8 is |
322 | * to capture 8th's of a hp fraction regens |
318 | * to capture 8th's of a hp fraction regens |
323 | * |
319 | * |
… | |
… | |
328 | op->last_heal += (int) ((float) (8 * op->stats.Con) / FABS (op->speed)); |
324 | op->last_heal += (int) ((float) (8 * op->stats.Con) / FABS (op->speed)); |
329 | op->stats.hp = MIN ((sint32) op->stats.hp + op->last_heal / 32, op->stats.maxhp); /* causes Con/4 hp/tick */ |
325 | op->stats.hp = MIN ((sint32) op->stats.hp + op->last_heal / 32, op->stats.maxhp); /* causes Con/4 hp/tick */ |
330 | op->last_heal %= 32; |
326 | op->last_heal %= 32; |
331 | |
327 | |
332 | /* So if the monster has gained enough HP that they are no longer afraid */ |
328 | /* So if the monster has gained enough HP that they are no longer afraid */ |
333 | if (QUERY_FLAG (op, FLAG_RUN_AWAY) && op->stats.hp >= (signed short) (((float) op->run_away / (float) 100) * (float) op->stats.maxhp)) |
329 | if (QUERY_FLAG (op, FLAG_RUN_AWAY) && op->stats.hp >= (signed short)(((float)op->run_away / 100.f) * (float)op->stats.maxhp)) |
334 | CLEAR_FLAG (op, FLAG_RUN_AWAY); |
330 | CLEAR_FLAG (op, FLAG_RUN_AWAY); |
335 | |
331 | |
336 | if (op->stats.hp > op->stats.maxhp) |
332 | if (op->stats.hp > op->stats.maxhp) |
337 | op->stats.hp = op->stats.maxhp; |
333 | op->stats.hp = op->stats.maxhp; |
338 | } |
334 | } |
339 | |
335 | |
340 | /* generate sp, if applicable */ |
336 | /* generate sp, if applicable */ |
341 | if (op->stats.Pow > 0 && op->stats.sp < op->stats.maxsp) |
337 | if (op->stats.Pow > 0 && op->stats.sp < op->stats.maxsp) |
342 | { |
338 | { |
343 | |
|
|
344 | /* last_sp is in funny units. Dividing by speed puts |
339 | /* last_sp is in funny units. Dividing by speed puts |
345 | * the regeneration rate on a basis of time instead of |
340 | * the regeneration rate on a basis of time instead of |
346 | * #moves the monster makes. The scaling by 8 is |
341 | * #moves the monster makes. The scaling by 8 is |
347 | * to capture 8th's of a sp fraction regens |
342 | * to capture 8th's of a sp fraction regens |
348 | * |
343 | * |
349 | * Cast to sint32 before comparing to maxhp since otherwise an (sint16) |
344 | * Cast to sint32 before comparing to maxhp since otherwise an (sint16) |
350 | * overflow might produce monsters with negative sp. |
345 | * overflow might produce monsters with negative sp. |
351 | */ |
346 | */ |
352 | |
347 | |
353 | op->last_sp += (int) ((float) (8 * op->stats.Pow) / FABS (op->speed)); |
348 | op->last_sp += (int) ((float) (8 * op->stats.Pow) / fabsf (op->speed)); |
354 | op->stats.sp = MIN (op->stats.sp + op->last_sp / 128, op->stats.maxsp); /* causes Pow/16 sp/tick */ |
349 | op->stats.sp = min (op->stats.sp + op->last_sp / 128, op->stats.maxsp); /* causes Pow/16 sp/tick */ |
355 | op->last_sp %= 128; |
350 | op->last_sp %= 128; |
356 | } |
351 | } |
357 | |
352 | |
358 | /* this should probably get modified by many more values. |
353 | /* this should probably get modified by many more values. |
359 | * (eg, creatures resistance to fear, level, etc. ) |
354 | * (eg, creatures resistance to fear, level, etc. ) |
360 | */ |
355 | */ |
361 | if (QUERY_FLAG (op, FLAG_SCARED) && !(rndm (20))) |
356 | if (QUERY_FLAG (op, FLAG_SCARED) && !(rndm (20))) |
362 | { |
|
|
363 | CLEAR_FLAG (op, FLAG_SCARED); /* Time to regain some "guts"... */ |
357 | CLEAR_FLAG (op, FLAG_SCARED); /* Time to regain some "guts"... */ |
364 | } |
|
|
365 | |
358 | |
366 | if (INVOKE_OBJECT (MONSTER_MOVE, op, ARG_OBJECT (op->enemy))) |
359 | if (INVOKE_OBJECT (MONSTER_MOVE, op, ARG_OBJECT (op->enemy))) |
367 | return QUERY_FLAG (op, FLAG_FREED); |
360 | return QUERY_FLAG (op, FLAG_FREED); |
368 | |
361 | |
369 | if (QUERY_FLAG (op, FLAG_SLEEP) || QUERY_FLAG (op, FLAG_BLIND) || |
362 | if (QUERY_FLAG (op, FLAG_SLEEP) || QUERY_FLAG (op, FLAG_BLIND) || |
370 | ((op->map->darkness > 0) && !QUERY_FLAG (op, FLAG_SEE_IN_DARK) && !QUERY_FLAG (op, FLAG_SEE_INVISIBLE))) |
363 | ((op->map->darklevel () > 0) && !QUERY_FLAG (op, FLAG_SEE_IN_DARK) && !QUERY_FLAG (op, FLAG_SEE_INVISIBLE))) |
371 | { |
|
|
372 | if (!check_wakeup (op, enemy, &rv)) |
364 | if (!check_wakeup (op, enemy, &rv)) |
373 | return 0; |
365 | return 0; |
374 | } |
|
|
375 | |
366 | |
376 | /* check if monster pops out of hidden spot */ |
367 | /* check if monster pops out of hidden spot */ |
377 | if (op->hide) |
368 | if (op->flag [FLAG_HIDDEN]) |
378 | do_hidden_move (op); |
369 | do_hidden_move (op); |
379 | |
370 | |
380 | if (op->pick_up) |
371 | if (op->pick_up) |
381 | monster_check_pickup (op); |
372 | monster_check_pickup (op); |
382 | |
373 | |
… | |
… | |
386 | /* If we don't have an enemy, do special movement or the like */ |
377 | /* If we don't have an enemy, do special movement or the like */ |
387 | if (!enemy) |
378 | if (!enemy) |
388 | { |
379 | { |
389 | if (QUERY_FLAG (op, FLAG_ONLY_ATTACK)) |
380 | if (QUERY_FLAG (op, FLAG_ONLY_ATTACK)) |
390 | { |
381 | { |
391 | op->destroy (); |
382 | op->drop_and_destroy (); |
392 | return 1; |
383 | return 1; |
393 | } |
384 | } |
394 | |
385 | |
395 | /* Probably really a bug for a creature to have both |
386 | /* Probably really a bug for a creature to have both |
396 | * stand still and a movement type set. |
387 | * stand still and a movement type set. |
… | |
… | |
399 | { |
390 | { |
400 | if (op->attack_movement & HI4) |
391 | if (op->attack_movement & HI4) |
401 | { |
392 | { |
402 | switch (op->attack_movement & HI4) |
393 | switch (op->attack_movement & HI4) |
403 | { |
394 | { |
404 | case (PETMOVE): |
395 | case PETMOVE: |
405 | pet_move (op); |
396 | pet_move (op); |
406 | break; |
397 | break; |
407 | |
398 | |
408 | case (CIRCLE1): |
399 | case CIRCLE1: |
409 | circ1_move (op); |
400 | circ1_move (op); |
410 | break; |
401 | break; |
411 | |
402 | |
412 | case (CIRCLE2): |
403 | case CIRCLE2: |
413 | circ2_move (op); |
404 | circ2_move (op); |
414 | break; |
405 | break; |
415 | |
406 | |
416 | case (PACEV): |
407 | case PACEV: |
417 | pace_movev (op); |
408 | pace_movev (op); |
418 | break; |
409 | break; |
419 | |
410 | |
420 | case (PACEH): |
411 | case PACEH: |
421 | pace_moveh (op); |
412 | pace_moveh (op); |
422 | break; |
413 | break; |
423 | |
414 | |
424 | case (PACEV2): |
415 | case PACEV2: |
425 | pace2_movev (op); |
416 | pace2_movev (op); |
426 | break; |
417 | break; |
427 | |
418 | |
428 | case (PACEH2): |
419 | case PACEH2: |
429 | pace2_moveh (op); |
420 | pace2_moveh (op); |
430 | break; |
421 | break; |
431 | |
422 | |
432 | case (RANDO): |
423 | case RANDO: |
433 | rand_move (op); |
424 | rand_move (op); |
434 | break; |
425 | break; |
435 | |
426 | |
436 | case (RANDO2): |
427 | case RANDO2: |
437 | move_randomly (op); |
428 | move_randomly (op); |
438 | break; |
429 | break; |
439 | } |
430 | } |
|
|
431 | |
440 | return 0; |
432 | return 0; |
441 | } |
433 | } |
442 | else if (QUERY_FLAG (op, FLAG_RANDOM_MOVE)) |
434 | else if (QUERY_FLAG (op, FLAG_RANDOM_MOVE)) |
443 | (void) move_randomly (op); |
435 | move_randomly (op); |
444 | |
|
|
445 | } /* stand still */ |
436 | } /* stand still */ |
|
|
437 | |
446 | return 0; |
438 | return 0; |
447 | } /* no enemy */ |
439 | } /* no enemy */ |
448 | |
440 | |
449 | /* We have an enemy. Block immediately below is for pets */ |
441 | /* We have an enemy. Block immediately below is for pets */ |
450 | if ((op->attack_movement & HI4) == PETMOVE |
442 | if ((op->attack_movement & HI4) == PETMOVE |
… | |
… | |
452 | && !on_same_map (op, owner) |
444 | && !on_same_map (op, owner) |
453 | && !owner->flag [FLAG_REMOVED]) |
445 | && !owner->flag [FLAG_REMOVED]) |
454 | return follow_owner (op, owner); |
446 | return follow_owner (op, owner); |
455 | |
447 | |
456 | /* doppleganger code to change monster facing to that of the nearest |
448 | /* doppleganger code to change monster facing to that of the nearest |
457 | * player. Hmm. The code is here, but no monster in the current |
449 | * player. Hmm. The code is here, but no monster in the current |
458 | * arch set uses it. |
450 | * arch set uses it. |
459 | */ |
451 | */ |
460 | if ((op->race != NULL) && strcmp (op->race, "doppleganger") == 0) |
452 | if (op->race == shstr_doppleganger) |
461 | { |
453 | { |
462 | op->face = enemy->face; |
454 | op->face = enemy->face; |
463 | op->name = enemy->name; |
455 | op->name = enemy->name; |
464 | } |
456 | } |
465 | |
457 | |
… | |
… | |
513 | if (monster_use_bow (op, part, enemy, dir)) |
505 | if (monster_use_bow (op, part, enemy, dir)) |
514 | return 0; |
506 | return 0; |
515 | } /* for processing of all parts */ |
507 | } /* for processing of all parts */ |
516 | } /* If not scared */ |
508 | } /* If not scared */ |
517 | |
509 | |
518 | |
|
|
519 | part = rv.part; |
510 | part = rv.part; |
520 | dir = rv.direction; |
511 | dir = rv.direction; |
521 | |
512 | |
|
|
513 | // if the enemy is a player, we have los. if los says we |
|
|
514 | // can directly reach the player, we do not deviate. |
|
|
515 | // for non-players, we never deviate |
|
|
516 | if (op->stats.Wis >= 8 |
|
|
517 | && enemy->contr && enemy->contr->darkness_at (op->map, op->x, op->y) == LOS_BLOCKED) |
|
|
518 | { |
|
|
519 | int sdir = 0; |
|
|
520 | uint32_t &smell = op->ms ().smell; |
|
|
521 | |
|
|
522 | for (int ndir = 1; ndir <= 8; ++ndir) |
|
|
523 | { |
|
|
524 | mapxy pos (op); pos.move (ndir); |
|
|
525 | |
|
|
526 | if (pos.normalise ()) |
|
|
527 | { |
|
|
528 | mapspace &ms = pos.ms (); |
|
|
529 | |
|
|
530 | if (ms.smell > smell) |
|
|
531 | { |
|
|
532 | //printf ("%s: found smell, following it, apparently (%d, %d)\n",& op->name,op->ms().smell,ms.smell);//D |
|
|
533 | if (op->stats.Wis >= 10) |
|
|
534 | smell = ms.smell - 1; // smarter: tell others |
|
|
535 | |
|
|
536 | sdir = ndir; |
|
|
537 | |
|
|
538 | // perturbing the path might let the monster lose track, |
|
|
539 | // but it will also widen the actual path, spreading information |
|
|
540 | if (op->stats.Wis >= 15 && !rndm (20)) // even smarter, deviate and spread? |
|
|
541 | sdir = absdir (sdir + 1 - rndm (2) * 2); |
|
|
542 | } |
|
|
543 | } |
|
|
544 | } |
|
|
545 | |
|
|
546 | if (sdir) |
|
|
547 | dir = sdir; |
|
|
548 | else if (smell) |
|
|
549 | { |
|
|
550 | // no better smell found, so assume the player jumped, and erase this smell |
|
|
551 | //printf ("erasing smell %d\n", op->ms ().smell);//D |
|
|
552 | unordered_mapwalk (op, -1, -1, 1, 1) |
|
|
553 | m->at (nx, ny).smell = 0; |
|
|
554 | } |
|
|
555 | } |
|
|
556 | |
522 | if (QUERY_FLAG (op, FLAG_SCARED) || QUERY_FLAG (op, FLAG_RUN_AWAY)) |
557 | if (QUERY_FLAG (op, FLAG_SCARED) || QUERY_FLAG (op, FLAG_RUN_AWAY)) |
523 | dir = absdir (dir + 4); |
558 | dir = absdir (dir + 4); |
524 | |
559 | |
525 | if (QUERY_FLAG (op, FLAG_CONFUSED)) |
560 | if (QUERY_FLAG (op, FLAG_CONFUSED)) |
526 | dir = absdir (dir + rndm (3) + rndm (3) - 2); |
561 | dir = absdir (dir + rndm (3) + rndm (3) - 2); |
… | |
… | |
529 | |
564 | |
530 | if ((op->attack_movement & LO4) && !QUERY_FLAG (op, FLAG_SCARED)) |
565 | if ((op->attack_movement & LO4) && !QUERY_FLAG (op, FLAG_SCARED)) |
531 | { |
566 | { |
532 | switch (op->attack_movement & LO4) |
567 | switch (op->attack_movement & LO4) |
533 | { |
568 | { |
534 | case DISTATT: |
569 | case DISTATT: |
535 | dir = dist_att (dir, op, enemy, part, &rv); |
570 | dir = dist_att (dir, op, enemy, part, &rv); |
536 | break; |
571 | break; |
537 | |
572 | |
538 | case RUNATT: |
573 | case RUNATT: |
539 | dir = run_att (dir, op, enemy, part, &rv); |
574 | dir = run_att (dir, op, enemy, part, &rv); |
540 | break; |
575 | break; |
541 | |
576 | |
542 | case HITRUN: |
577 | case HITRUN: |
543 | dir = hitrun_att (dir, op, enemy); |
578 | dir = hitrun_att (dir, op, enemy); |
544 | break; |
579 | break; |
545 | |
580 | |
546 | case WAITATT: |
581 | case WAITATT: |
547 | dir = wait_att (dir, op, enemy, part, &rv); |
582 | dir = wait_att (dir, op, enemy, part, &rv); |
548 | break; |
583 | break; |
549 | |
584 | |
550 | case RUSH: /* default - monster normally moves towards player */ |
585 | case RUSH: /* default - monster normally moves towards player */ |
551 | case ALLRUN: |
586 | case ALLRUN: |
552 | break; |
587 | break; |
553 | |
588 | |
554 | case DISTHIT: |
589 | case DISTHIT: |
555 | dir = disthit_att (dir, op, enemy, part, &rv); |
590 | dir = disthit_att (dir, op, enemy, part, &rv); |
556 | break; |
591 | break; |
557 | |
592 | |
558 | case WAIT2: |
593 | case WAIT2: |
559 | dir = wait_att2 (dir, op, enemy, part, &rv); |
594 | dir = wait_att2 (dir, op, enemy, part, &rv); |
560 | break; |
595 | break; |
561 | |
596 | |
562 | default: |
597 | default: |
563 | LOG (llevDebug, "Illegal low mon-move: %d\n", op->attack_movement & LO4); |
598 | LOG (llevDebug, "Illegal low mon-move: %d\n", op->attack_movement & LO4); |
564 | } |
599 | } |
565 | } |
600 | } |
566 | |
601 | |
567 | if (!dir) |
602 | if (!dir) |
568 | return 0; |
603 | return 0; |
… | |
… | |
578 | return 0; |
613 | return 0; |
579 | } |
614 | } |
580 | |
615 | |
581 | if (QUERY_FLAG (op, FLAG_SCARED) || !can_hit (part, enemy, &rv) || QUERY_FLAG (op, FLAG_RUN_AWAY)) |
616 | if (QUERY_FLAG (op, FLAG_SCARED) || !can_hit (part, enemy, &rv) || QUERY_FLAG (op, FLAG_RUN_AWAY)) |
582 | { |
617 | { |
583 | |
|
|
584 | /* Try move around corners if !close */ |
618 | /* Try move around corners if !close */ |
585 | int maxdiff = (QUERY_FLAG (op, FLAG_ONLY_ATTACK) || RANDOM () & 1) ? 1 : 2; |
619 | int maxdiff = (QUERY_FLAG (op, FLAG_ONLY_ATTACK) || rndm (2)) ? 1 : 2; |
586 | |
620 | |
587 | for (diff = 1; diff <= maxdiff; diff++) |
621 | for (diff = 1; diff <= maxdiff; diff++) |
588 | { |
622 | { |
589 | /* try different detours */ |
623 | /* try different detours */ |
590 | int m = 1 - (RANDOM () & 2); /* Try left or right first? */ |
624 | int m = 1 - rndm (2) * 2; /* Try left or right first? */ |
591 | |
625 | |
592 | if (move_object (op, absdir (dir + diff * m)) || move_object (op, absdir (dir - diff * m))) |
626 | if (move_object (op, absdir (dir + diff * m)) || move_object (op, absdir (dir - diff * m))) |
593 | return 0; |
627 | return 0; |
594 | } |
628 | } |
595 | } |
629 | } |
… | |
… | |
622 | { |
656 | { |
623 | object *nearest_player = get_nearest_player (op); |
657 | object *nearest_player = get_nearest_player (op); |
624 | |
658 | |
625 | if (nearest_player && nearest_player != enemy && !can_hit (part, enemy, &rv)) |
659 | if (nearest_player && nearest_player != enemy && !can_hit (part, enemy, &rv)) |
626 | { |
660 | { |
627 | op->enemy = NULL; |
661 | op->enemy = 0; |
628 | enemy = nearest_player; |
662 | enemy = nearest_player; |
629 | } |
663 | } |
630 | } |
664 | } |
631 | |
665 | |
632 | if (!QUERY_FLAG (op, FLAG_SCARED) && can_hit (part, enemy, &rv)) |
666 | if (!QUERY_FLAG (op, FLAG_SCARED) && can_hit (part, enemy, &rv)) |
… | |
… | |
638 | * still be pretty nasty. |
672 | * still be pretty nasty. |
639 | */ |
673 | */ |
640 | if (QUERY_FLAG (op, FLAG_RUN_AWAY)) |
674 | if (QUERY_FLAG (op, FLAG_RUN_AWAY)) |
641 | { |
675 | { |
642 | part->stats.wc += 10; |
676 | part->stats.wc += 10; |
643 | (void) skill_attack (enemy, part, 0, NULL, NULL); |
677 | skill_attack (enemy, part, 0, NULL, NULL); |
644 | part->stats.wc -= 10; |
678 | part->stats.wc -= 10; |
645 | } |
679 | } |
646 | else |
680 | else |
647 | (void) skill_attack (enemy, part, 0, NULL, NULL); |
681 | skill_attack (enemy, part, 0, NULL, NULL); |
648 | } /* if monster is in attack range */ |
682 | } /* if monster is in attack range */ |
649 | |
683 | |
650 | if (QUERY_FLAG (part, FLAG_FREED)) /* Might be freed by ghost-attack or hit-back */ |
684 | if (QUERY_FLAG (part, FLAG_FREED)) /* Might be freed by ghost-attack or hit-back */ |
651 | return 1; |
685 | return 1; |
652 | |
686 | |
653 | if (QUERY_FLAG (op, FLAG_ONLY_ATTACK)) |
687 | if (QUERY_FLAG (op, FLAG_ONLY_ATTACK)) |
654 | { |
688 | { |
655 | op->remove (); |
|
|
656 | op->destroy (); |
689 | op->drop_and_destroy (); |
657 | return 1; |
690 | return 1; |
658 | } |
691 | } |
|
|
692 | |
659 | return 0; |
693 | return 0; |
660 | } |
694 | } |
661 | |
695 | |
662 | int |
696 | int |
663 | can_hit (object *ob1, object *ob2, rv_vector * rv) |
697 | can_hit (object *ob1, object *ob2, rv_vector * rv) |
… | |
… | |
678 | { |
712 | { |
679 | get_rangevector (ob1, more, &rv1, 0); |
713 | get_rangevector (ob1, more, &rv1, 0); |
680 | if (abs (rv1.distance_x) < 2 && abs (rv1.distance_y) < 2) |
714 | if (abs (rv1.distance_x) < 2 && abs (rv1.distance_y) < 2) |
681 | return 1; |
715 | return 1; |
682 | } |
716 | } |
|
|
717 | |
683 | return 0; |
718 | return 0; |
684 | |
|
|
685 | } |
719 | } |
686 | |
720 | |
687 | /* Returns 1 is monster should cast spell sp at an enemy |
721 | /* Returns 1 is monster should cast spell sp at an enemy |
688 | * Returns 0 if the monster should not cast this spell. |
722 | * Returns 0 if the monster should not cast this spell. |
689 | * |
723 | * |
… | |
… | |
707 | spell_ob->subtype == SP_EXPLOSION || spell_ob->subtype == SP_CONE || |
741 | spell_ob->subtype == SP_EXPLOSION || spell_ob->subtype == SP_CONE || |
708 | spell_ob->subtype == SP_BOMB || spell_ob->subtype == SP_SMITE || |
742 | spell_ob->subtype == SP_BOMB || spell_ob->subtype == SP_SMITE || |
709 | spell_ob->subtype == SP_MAGIC_MISSILE || spell_ob->subtype == SP_SUMMON_GOLEM || |
743 | spell_ob->subtype == SP_MAGIC_MISSILE || spell_ob->subtype == SP_SUMMON_GOLEM || |
710 | spell_ob->subtype == SP_MAGIC_WALL || spell_ob->subtype == SP_SUMMON_MONSTER || |
744 | spell_ob->subtype == SP_MAGIC_WALL || spell_ob->subtype == SP_SUMMON_MONSTER || |
711 | spell_ob->subtype == SP_MOVING_BALL || spell_ob->subtype == SP_SWARM || spell_ob->subtype == SP_INVISIBLE) |
745 | spell_ob->subtype == SP_MOVING_BALL || spell_ob->subtype == SP_SWARM || spell_ob->subtype == SP_INVISIBLE) |
712 | |
|
|
713 | return 1; |
746 | return 1; |
714 | |
747 | |
715 | return 0; |
748 | return 0; |
716 | } |
749 | } |
717 | |
|
|
718 | |
750 | |
719 | #define MAX_KNOWN_SPELLS 20 |
751 | #define MAX_KNOWN_SPELLS 20 |
720 | |
752 | |
721 | /* Returns a randomly selected spell. This logic is still |
753 | /* Returns a randomly selected spell. This logic is still |
722 | * less than ideal. This code also only seems to deal with |
754 | * less than ideal. This code also only seems to deal with |
… | |
… | |
725 | */ |
757 | */ |
726 | object * |
758 | object * |
727 | monster_choose_random_spell (object *monster) |
759 | monster_choose_random_spell (object *monster) |
728 | { |
760 | { |
729 | object *altern[MAX_KNOWN_SPELLS]; |
761 | object *altern[MAX_KNOWN_SPELLS]; |
730 | object *tmp; |
|
|
731 | int i = 0; |
762 | int i = 0; |
732 | |
763 | |
733 | for (tmp = monster->inv; tmp != NULL; tmp = tmp->below) |
764 | for (object *tmp = monster->inv; tmp; tmp = tmp->below) |
734 | if (tmp->type == SPELLBOOK || tmp->type == SPELL) |
765 | if (tmp->type == SPELLBOOK || tmp->type == SPELL) |
735 | { |
766 | { |
736 | /* Check and see if it's actually a useful spell. |
767 | /* Check and see if it's actually a useful spell. |
737 | * If its a spellbook, the spell is actually the inventory item. |
768 | * If its a spellbook, the spell is actually the inventory item. |
738 | * if it is a spell, then it is just the object itself. |
769 | * if it is a spell, then it is just the object itself. |
739 | */ |
770 | */ |
740 | if (monster_should_cast_spell (monster, (tmp->type == SPELLBOOK) ? tmp->inv : tmp)) |
771 | if (monster_should_cast_spell (monster, (tmp->type == SPELLBOOK) ? tmp->inv : tmp)) |
741 | { |
772 | { |
742 | altern[i++] = tmp; |
773 | altern [i++] = tmp; |
|
|
774 | |
743 | if (i == MAX_KNOWN_SPELLS) |
775 | if (i == MAX_KNOWN_SPELLS) |
744 | break; |
776 | break; |
745 | } |
777 | } |
746 | } |
778 | } |
747 | if (!i) |
779 | |
748 | return NULL; |
780 | return i ? altern [rndm (i)] : 0; |
749 | return altern[RANDOM () % i]; |
|
|
750 | } |
781 | } |
751 | |
782 | |
752 | /* This checks to see if the monster should cast a spell/ability. |
783 | /* This checks to see if the monster should cast a spell/ability. |
753 | * it returns true if the monster casts a spell, 0 if he doesn't. |
784 | * it returns true if the monster casts a spell, 0 if he doesn't. |
754 | * head is the head of the monster. |
785 | * head is the head of the monster. |
755 | * part is the part of the monster we are checking against. |
786 | * part is the part of the monster we are checking against. |
756 | * pl is the target. |
787 | * pl is the target. |
757 | * dir is the direction to case. |
788 | * dir is the direction to case. |
758 | * rv is the vector which describes where the enemy is. |
789 | * rv is the vector which describes where the enemy is. |
759 | */ |
790 | */ |
760 | |
|
|
761 | int |
791 | int |
762 | monster_cast_spell (object *head, object *part, object *pl, int dir, rv_vector * rv) |
792 | monster_cast_spell (object *head, object *part, object *pl, int dir, rv_vector * rv) |
763 | { |
793 | { |
764 | object *spell_item; |
794 | object *spell_item; |
765 | object *owner; |
795 | object *owner; |
… | |
… | |
776 | |
806 | |
777 | if (QUERY_FLAG (head, FLAG_FRIENDLY) && (owner = head->owner) != NULL) |
807 | if (QUERY_FLAG (head, FLAG_FRIENDLY) && (owner = head->owner) != NULL) |
778 | { |
808 | { |
779 | get_rangevector (head, owner, &rv1, 0x1); |
809 | get_rangevector (head, owner, &rv1, 0x1); |
780 | if (dirdiff (dir, rv1.direction) < 2) |
810 | if (dirdiff (dir, rv1.direction) < 2) |
781 | { |
|
|
782 | return 0; /* Might hit owner with spell */ |
811 | return 0; /* Might hit owner with spell */ |
783 | } |
|
|
784 | } |
812 | } |
785 | |
813 | |
786 | if (QUERY_FLAG (head, FLAG_CONFUSED)) |
814 | if (QUERY_FLAG (head, FLAG_CONFUSED)) |
787 | dir = absdir (dir + rndm (3) + rndm (3) - 2); |
815 | dir = absdir (dir + rndm (3) + rndm (3) - 2); |
788 | |
816 | |
… | |
… | |
796 | { |
824 | { |
797 | LOG (llevMonster, "Turned off spells in %s\n", &head->name); |
825 | LOG (llevMonster, "Turned off spells in %s\n", &head->name); |
798 | CLEAR_FLAG (head, FLAG_CAST_SPELL); /* Will be turned on when picking up book */ |
826 | CLEAR_FLAG (head, FLAG_CAST_SPELL); /* Will be turned on when picking up book */ |
799 | return 0; |
827 | return 0; |
800 | } |
828 | } |
|
|
829 | |
801 | if (spell_item->type == SPELLBOOK) |
830 | if (spell_item->type == SPELLBOOK) |
802 | { |
831 | { |
803 | if (!spell_item->inv) |
832 | if (!spell_item->inv) |
804 | { |
833 | { |
805 | LOG (llevError, "spellbook %s does not contain a spell?\n", &spell_item->name); |
834 | LOG (llevError, "spellbook %s does not contain a spell?\n", &spell_item->name); |
806 | return 0; |
835 | return 0; |
807 | } |
836 | } |
|
|
837 | |
808 | spell_item = spell_item->inv; |
838 | spell_item = spell_item->inv; |
809 | } |
839 | } |
810 | } |
840 | } |
811 | else |
841 | else |
812 | spell_item = head->spellitem; |
842 | spell_item = head->spellitem; |
… | |
… | |
831 | /* set this to null, so next time monster will choose something different */ |
861 | /* set this to null, so next time monster will choose something different */ |
832 | head->spellitem = NULL; |
862 | head->spellitem = NULL; |
833 | |
863 | |
834 | return cast_spell (part, part, dir, spell_item, NULL); |
864 | return cast_spell (part, part, dir, spell_item, NULL); |
835 | } |
865 | } |
836 | |
|
|
837 | |
866 | |
838 | int |
867 | int |
839 | monster_use_scroll (object *head, object *part, object *pl, int dir, rv_vector * rv) |
868 | monster_use_scroll (object *head, object *part, object *pl, int dir, rv_vector * rv) |
840 | { |
869 | { |
841 | object *scroll; |
870 | object *scroll; |
… | |
… | |
1233 | } |
1262 | } |
1234 | } |
1263 | } |
1235 | |
1264 | |
1236 | if (((!(monster->pick_up & 32)) && flag) || ((monster->pick_up & 32) && (!flag))) |
1265 | if (((!(monster->pick_up & 32)) && flag) || ((monster->pick_up & 32) && (!flag))) |
1237 | return 1; |
1266 | return 1; |
|
|
1267 | |
1238 | return 0; |
1268 | return 0; |
1239 | } |
1269 | } |
1240 | |
1270 | |
1241 | /* |
1271 | /* |
1242 | * monster_apply_below(): |
1272 | * monster_apply_below(): |
… | |
… | |
1390 | } |
1420 | } |
1391 | |
1421 | |
1392 | void |
1422 | void |
1393 | npc_call_help (object *op) |
1423 | npc_call_help (object *op) |
1394 | { |
1424 | { |
1395 | int x, y, mflags; |
1425 | unordered_mapwalk (op, -7, -7, 7, 7) |
1396 | object *npc; |
|
|
1397 | sint16 sx, sy; |
|
|
1398 | maptile *m; |
|
|
1399 | |
|
|
1400 | for (x = -3; x < 4; x++) |
|
|
1401 | for (y = -3; y < 4; y++) |
|
|
1402 | { |
1426 | { |
1403 | m = op->map; |
1427 | mapspace &ms = m->at (nx, ny); |
1404 | sx = op->x + x; |
1428 | |
1405 | sy = op->y + y; |
|
|
1406 | mflags = get_map_flags (m, &m, sx, sy, &sx, &sy); |
|
|
1407 | /* If nothing alive on this space, no need to search the space. */ |
1429 | /* If nothing alive on this space, no need to search the space. */ |
1408 | if ((mflags & P_OUT_OF_MAP) || !(mflags & P_IS_ALIVE)) |
1430 | if (!(ms.flags () & P_IS_ALIVE)) |
1409 | continue; |
1431 | continue; |
1410 | |
1432 | |
1411 | for (npc = GET_MAP_OB (m, sx, sy); npc != NULL; npc = npc->above) |
1433 | for (object *npc = ms.bot; npc; npc = npc->above) |
1412 | if (QUERY_FLAG (npc, FLAG_ALIVE) && QUERY_FLAG (npc, FLAG_UNAGGRESSIVE)) |
1434 | if (QUERY_FLAG (npc, FLAG_ALIVE) && QUERY_FLAG (npc, FLAG_UNAGGRESSIVE)) |
1413 | npc->enemy = op->enemy; |
1435 | npc->enemy = op->enemy; |
1414 | } |
1436 | } |
1415 | } |
1437 | } |
1416 | |
1438 | |
1417 | int |
1439 | int |
1418 | dist_att (int dir, object *ob, object *enemy, object *part, rv_vector * rv) |
1440 | dist_att (int dir, object *ob, object *enemy, object *part, rv_vector *rv) |
1419 | { |
1441 | { |
1420 | if (can_hit (part, enemy, rv)) |
1442 | if (can_hit (part, enemy, rv)) |
1421 | return dir; |
1443 | return dir; |
|
|
1444 | |
1422 | if (rv->distance < 10) |
1445 | if (rv->distance < 10) |
1423 | return absdir (dir + 4); |
1446 | return absdir (dir + 4); |
1424 | else if (rv->distance > 18) |
1447 | else if (rv->distance > 18) |
1425 | return dir; |
1448 | return dir; |
1426 | |
1449 | |
1427 | return 0; |
1450 | return 0; |
1428 | } |
1451 | } |
1429 | |
1452 | |
1430 | int |
1453 | int |
1431 | run_att (int dir, object *ob, object *enemy, object *part, rv_vector * rv) |
1454 | run_att (int dir, object *ob, object *enemy, object *part, rv_vector *rv) |
1432 | { |
1455 | { |
1433 | if ((can_hit (part, enemy, rv) && ob->move_status < 20) || ob->move_status < 20) |
1456 | if (can_hit (part, enemy, rv)) |
1434 | { |
|
|
1435 | ob->move_status++; |
|
|
1436 | return (dir); |
1457 | return dir; |
1437 | } |
1458 | else |
1438 | else if (ob->move_status > 20) |
|
|
1439 | ob->move_status = 0; |
|
|
1440 | |
|
|
1441 | return absdir (dir + 4); |
1459 | return absdir (dir + 4); |
1442 | } |
1460 | } |
1443 | |
1461 | |
1444 | int |
1462 | int |
1445 | hitrun_att (int dir, object *ob, object *enemy) |
1463 | hitrun_att (int dir, object *ob, object *enemy) |
1446 | { |
1464 | { |
… | |
… | |
1455 | } |
1473 | } |
1456 | |
1474 | |
1457 | int |
1475 | int |
1458 | wait_att (int dir, object *ob, object *enemy, object *part, rv_vector * rv) |
1476 | wait_att (int dir, object *ob, object *enemy, object *part, rv_vector * rv) |
1459 | { |
1477 | { |
1460 | |
|
|
1461 | int inrange = can_hit (part, enemy, rv); |
1478 | int inrange = can_hit (part, enemy, rv); |
1462 | |
1479 | |
1463 | if (ob->move_status || inrange) |
1480 | if (ob->move_status || inrange) |
1464 | ob->move_status++; |
1481 | ob->move_status++; |
1465 | |
1482 | |
… | |
… | |
1475 | } |
1492 | } |
1476 | |
1493 | |
1477 | int |
1494 | int |
1478 | disthit_att (int dir, object *ob, object *enemy, object *part, rv_vector * rv) |
1495 | disthit_att (int dir, object *ob, object *enemy, object *part, rv_vector * rv) |
1479 | { |
1496 | { |
1480 | |
|
|
1481 | /* The logic below here looked plain wrong before. Basically, what should |
1497 | /* The logic below here looked plain wrong before. Basically, what should |
1482 | * happen is that if the creatures hp percentage falls below run_away, |
1498 | * happen is that if the creatures hp percentage falls below run_away, |
1483 | * the creature should run away (dir+4) |
1499 | * the creature should run away (dir+4) |
1484 | * I think its wrong for a creature to have a zero maxhp value, but |
1500 | * I think its wrong for a creature to have a zero maxhp value, but |
1485 | * at least one map has this set, and whatever the map contains, the |
1501 | * at least one map has this set, and whatever the map contains, the |
… | |
… | |
1581 | } |
1597 | } |
1582 | |
1598 | |
1583 | void |
1599 | void |
1584 | rand_move (object *ob) |
1600 | rand_move (object *ob) |
1585 | { |
1601 | { |
1586 | int i; |
|
|
1587 | |
|
|
1588 | if (ob->move_status < 1 || ob->move_status > 8 || !(move_object (ob, ob->move_status || !(rndm (9))))) |
1602 | if (ob->move_status < 1 || ob->move_status > 8 || !(move_object (ob, ob->move_status || !(rndm (9))))) |
1589 | for (i = 0; i < 5; i++) |
1603 | for (int i = 0; i < 5; i++) |
1590 | if (move_object (ob, ob->move_status = rndm (8) + 1)) |
1604 | if (move_object (ob, ob->move_status = rndm (8) + 1)) |
1591 | return; |
1605 | return; |
1592 | } |
1606 | } |
1593 | |
1607 | |
1594 | void |
1608 | void |
1595 | check_earthwalls (object *op, maptile *m, int x, int y) |
1609 | check_earthwalls (object *op, maptile *m, int x, int y) |
1596 | { |
1610 | { |
1597 | object *tmp; |
|
|
1598 | |
|
|
1599 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1611 | for (object *tmp = GET_MAP_OB (m, x, y); tmp; tmp = tmp->above) |
1600 | { |
|
|
1601 | if (tmp->type == EARTHWALL) |
1612 | if (tmp->type == EARTHWALL) |
1602 | { |
1613 | { |
1603 | hit_player (tmp, op->stats.dam, op, AT_PHYSICAL, 1); |
1614 | hit_player (tmp, op->stats.dam, op, AT_PHYSICAL, 1); |
1604 | return; |
1615 | return; |
1605 | } |
1616 | } |
1606 | } |
|
|
1607 | } |
1617 | } |
1608 | |
1618 | |
1609 | void |
1619 | void |
1610 | check_doors (object *op, maptile *m, int x, int y) |
1620 | check_doors (object *op, maptile *m, int x, int y) |
1611 | { |
1621 | { |
1612 | object *tmp; |
|
|
1613 | |
|
|
1614 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1622 | for (object *tmp = GET_MAP_OB (m, x, y); tmp; tmp = tmp->above) |
1615 | { |
|
|
1616 | if (tmp->type == DOOR) |
1623 | if (tmp->type == DOOR) |
1617 | { |
1624 | { |
1618 | hit_player (tmp, 1000, op, AT_PHYSICAL, 1); |
1625 | hit_player (tmp, 1000, op, AT_PHYSICAL, 1); |
1619 | return; |
1626 | return; |
1620 | } |
1627 | } |
1621 | } |
|
|
1622 | } |
1628 | } |
1623 | |
1629 | |
1624 | /* find_mon_throw_ob() - modeled on find_throw_ob |
1630 | /* find_mon_throw_ob() - modeled on find_throw_ob |
1625 | * This is probably overly simplistic as it is now - We want |
1631 | * This is probably overly simplistic as it is now - We want |
1626 | * monsters to throw things like chairs and other pieces of |
1632 | * monsters to throw things like chairs and other pieces of |
… | |
… | |
1669 | * Returns 0 if enemy can not be detected, 1 if it is detected |
1675 | * Returns 0 if enemy can not be detected, 1 if it is detected |
1670 | */ |
1676 | */ |
1671 | int |
1677 | int |
1672 | can_detect_enemy (object *op, object *enemy, rv_vector * rv) |
1678 | can_detect_enemy (object *op, object *enemy, rv_vector * rv) |
1673 | { |
1679 | { |
1674 | int radius = MIN_MON_RADIUS, hide_discovery; |
|
|
1675 | |
|
|
1676 | /* null detection for any of these condtions always */ |
1680 | /* null detection for any of these condtions always */ |
1677 | if (!op || !enemy || !op->map || !enemy->map) |
1681 | if (!op || !enemy || !op->map || !enemy->map) |
1678 | return 0; |
1682 | return 0; |
1679 | |
1683 | |
1680 | /* If the monster (op) has no way to get to the enemy, do nothing */ |
1684 | /* If the monster (op) has no way to get to the enemy, do nothing */ |
… | |
… | |
1682 | return 0; |
1686 | return 0; |
1683 | |
1687 | |
1684 | get_rangevector (op, enemy, rv, 0); |
1688 | get_rangevector (op, enemy, rv, 0); |
1685 | |
1689 | |
1686 | /* Monsters always ignore the DM */ |
1690 | /* Monsters always ignore the DM */ |
1687 | if ((op->type != PLAYER) && QUERY_FLAG (enemy, FLAG_WIZ)) |
1691 | if (!op->is_player () && QUERY_FLAG (enemy, FLAG_WIZ)) |
1688 | return 0; |
1692 | return 0; |
1689 | |
1693 | |
1690 | /* simple check. Should probably put some range checks in here. */ |
1694 | /* simple check. Should probably put some range checks in here. */ |
1691 | if (can_see_enemy (op, enemy)) |
1695 | if (can_see_enemy (op, enemy)) |
1692 | return 1; |
1696 | return 1; |
1693 | |
1697 | |
1694 | /* The rest of this is for monsters. Players are on their own for |
1698 | /* The rest of this is for monsters. Players are on their own for |
1695 | * finding enemies! |
1699 | * finding enemies! |
1696 | */ |
1700 | */ |
1697 | if (op->type == PLAYER) |
1701 | if (op->is_player ()) |
1698 | return 0; |
1702 | return 0; |
1699 | |
1703 | |
1700 | /* Quality invisible? Bah, we wont see them w/o SEE_INVISIBLE |
1704 | /* Quality invisible? Bah, we wont see them w/o SEE_INVISIBLE |
1701 | * flag (which was already checked) in can_see_enmy (). Lets get out of here |
1705 | * flag (which was already checked) in can_see_enemy (). Lets get out of here |
1702 | */ |
1706 | */ |
1703 | if (enemy->invisible && (!enemy->contr || (!enemy->contr->tmp_invis && !enemy->contr->hidden))) |
1707 | if (enemy->invisible && (!enemy->contr || (!enemy->contr->tmp_invis && !enemy->contr->hidden))) |
1704 | return 0; |
1708 | return 0; |
1705 | |
1709 | |
|
|
1710 | int radius = MIN_MON_RADIUS; |
|
|
1711 | |
1706 | /* use this for invis also */ |
1712 | /* use this for invis also */ |
1707 | hide_discovery = op->stats.Int / 5; |
1713 | int hide_discovery = op->stats.Int / 5; |
1708 | |
1714 | |
1709 | /* Determine Detection radii */ |
1715 | /* Determine Detection radii */ |
1710 | if (!enemy->hide) /* to detect non-hidden (eg dark/invis enemy) */ |
1716 | if (!enemy->flag [FLAG_HIDDEN]) /* to detect non-hidden (eg dark/invis enemy) */ |
1711 | radius = max (MIN_MON_RADIUS, op->stats.Wis / 5 + 1); |
1717 | radius = max (MIN_MON_RADIUS, op->stats.Wis / 3 + 1); |
1712 | else |
1718 | else |
1713 | { /* a level/INT/Dex adjustment for hiding */ |
1719 | { /* a level/INT/Dex adjustment for hiding */ |
1714 | int bonus = op->level / 2 + op->stats.Int / 5; |
1720 | int bonus = op->level / 2 + op->stats.Int / 5; |
1715 | |
1721 | |
1716 | if (enemy->type == PLAYER) |
1722 | if (enemy->is_player ()) |
1717 | { |
1723 | { |
1718 | if (object *sk_hide = find_skill_by_number (enemy, SK_HIDING)) |
1724 | if (object *sk_hide = find_skill_by_number (enemy, SK_HIDING)) |
1719 | bonus -= sk_hide->level; |
1725 | bonus -= sk_hide->level; |
1720 | else |
1726 | else |
1721 | { |
1727 | { |
… | |
… | |
1738 | radius /= 2; |
1744 | radius /= 2; |
1739 | hide_discovery /= 3; |
1745 | hide_discovery /= 3; |
1740 | } |
1746 | } |
1741 | |
1747 | |
1742 | /* Radii adjustment for enemy standing in the dark */ |
1748 | /* Radii adjustment for enemy standing in the dark */ |
1743 | if (op->map->darkness > 0 && !stand_in_light (enemy)) |
1749 | if (!stand_in_light (enemy)) |
1744 | { |
1750 | { |
1745 | /* on dark maps body heat can help indicate location with infravision |
1751 | /* on dark maps body heat can help indicate location with infravision |
1746 | * undead don't have body heat, so no benefit detecting them. |
1752 | * undead don't have body heat, so no benefit detecting them. |
1747 | */ |
1753 | */ |
1748 | if (QUERY_FLAG (op, FLAG_SEE_IN_DARK) && !is_true_undead (enemy)) |
1754 | if (QUERY_FLAG (op, FLAG_SEE_IN_DARK) && !is_true_undead (enemy)) |
1749 | radius += op->map->darkness / 2; |
1755 | radius += op->map->darklevel () / 2; |
1750 | else |
1756 | else |
1751 | radius -= op->map->darkness / 2; |
1757 | radius -= op->map->darklevel () / 2; |
1752 | |
1758 | |
1753 | /* op next to a monster (and not in complete darkness) |
1759 | /* op next to a monster (and not in complete darkness) |
1754 | * the monster should have a chance to see you. |
1760 | * the monster should have a chance to see you. |
1755 | */ |
1761 | */ |
1756 | if (radius < MIN_MON_RADIUS && op->map->darkness < 5 && rv->distance <= 1) |
1762 | if (radius < MIN_MON_RADIUS && op->map->darklevel () < MAX_DARKNESS && rv->distance <= 1) |
1757 | radius = MIN_MON_RADIUS; |
1763 | radius = MIN_MON_RADIUS; |
1758 | } /* if on dark map */ |
1764 | } /* if on dark map */ |
1759 | |
1765 | |
1760 | /* Lets not worry about monsters that have incredible detection |
1766 | /* Lets not worry about monsters that have incredible detection |
1761 | * radii, we only need to worry here about things the player can |
1767 | * radii, we only need to worry here about things the player can |
… | |
… | |
1768 | // note that the above reasoning was utter bullshit even at the time it was written |
1774 | // note that the above reasoning was utter bullshit even at the time it was written |
1769 | // we use 25, lets see if we have the cpu time for it |
1775 | // we use 25, lets see if we have the cpu time for it |
1770 | radius = min (25, radius); |
1776 | radius = min (25, radius); |
1771 | |
1777 | |
1772 | /* Enemy in range! Now test for detection */ |
1778 | /* Enemy in range! Now test for detection */ |
1773 | if ((int) rv->distance <= radius) |
1779 | if (rv->distance <= radius) |
1774 | { |
1780 | { |
1775 | /* ah, we are within range, detected? take cases */ |
1781 | /* ah, we are within range, detected? take cases */ |
1776 | if (!enemy->invisible) /* enemy in dark squares... are seen! */ |
1782 | if (!enemy->invisible) /* enemy in dark squares... are seen! */ |
1777 | return 1; |
1783 | return 1; |
1778 | |
1784 | |
1779 | /* hidden or low-quality invisible */ |
1785 | /* hidden or low-quality invisible */ |
1780 | if (enemy->hide && rv->distance <= 1 && rndm (100) <= hide_discovery) |
1786 | if (enemy->flag [FLAG_HIDDEN] && rv->distance <= 1 && rndm (100) <= hide_discovery) |
1781 | { |
1787 | { |
1782 | make_visible (enemy); |
1788 | make_visible (enemy); |
1783 | |
1789 | |
1784 | /* inform players of new status */ |
1790 | /* inform players of new status */ |
1785 | if (enemy->type == PLAYER && player_can_view (enemy, op)) |
1791 | if (enemy->type == PLAYER && player_can_view (enemy, op)) |
… | |
… | |
1809 | /* Wasn't detected above, so still hidden */ |
1815 | /* Wasn't detected above, so still hidden */ |
1810 | return 0; |
1816 | return 0; |
1811 | } |
1817 | } |
1812 | |
1818 | |
1813 | /* determine if op stands in a lighted square. This is not a very |
1819 | /* determine if op stands in a lighted square. This is not a very |
1814 | * intellegent algorithm. For one thing, we ignore los here, SO it |
1820 | * intelligent algorithm. For one thing, we ignore los here, SO it |
1815 | * is possible for a bright light to illuminate a player on the |
1821 | * is possible for a bright light to illuminate a player on the |
1816 | * other side of a wall (!). |
1822 | * other side of a wall (!). |
1817 | */ |
1823 | */ |
1818 | int |
1824 | int |
1819 | stand_in_light (object *op) |
1825 | stand_in_light (object *op) |
1820 | { |
1826 | { |
1821 | sint16 nx, ny; |
|
|
1822 | maptile *m; |
|
|
1823 | |
|
|
1824 | if (!op) |
1827 | if (op) |
|
|
1828 | { |
|
|
1829 | if (!op->is_on_map ()) |
1825 | return 0; |
1830 | return 0; |
1826 | |
1831 | |
|
|
1832 | if (op->map->darklevel () <= 0) |
|
|
1833 | return 1; |
|
|
1834 | |
1827 | if (op->glow_radius > 0) |
1835 | if (op->glow_radius > 0) |
1828 | return 1; |
1836 | return 1; |
1829 | |
1837 | |
1830 | if (op->map) |
1838 | if (op->map) |
1831 | { |
1839 | unordered_mapwalk (op, -MAX_LIGHT_RADIUS, -MAX_LIGHT_RADIUS, MAX_LIGHT_RADIUS, MAX_LIGHT_RADIUS) |
1832 | int x, y, x1, y1; |
1840 | { |
1833 | |
|
|
1834 | /* Check the spaces with the max light radius to see if any of them |
1841 | /* Check the spaces with the max light radius to see if any of them |
1835 | * have lights, and if any of them light the player enough, then return 1. |
1842 | * have lights, and if any of them light the player enough, then return 1. |
1836 | */ |
|
|
1837 | for (x = op->x - MAX_LIGHT_RADII; x <= op->x + MAX_LIGHT_RADII; x++) |
|
|
1838 | { |
|
|
1839 | for (y = op->y - MAX_LIGHT_RADII; y <= op->y + MAX_LIGHT_RADII; y++) |
|
|
1840 | { |
1843 | */ |
1841 | m = op->map; |
1844 | int light = m->at (nx, ny).light; |
1842 | nx = x; |
|
|
1843 | ny = y; |
|
|
1844 | |
1845 | |
1845 | if (get_map_flags (m, &m, nx, ny, &nx, &ny) & P_OUT_OF_MAP) |
1846 | if (expect_false (light > 0) && idistance (dx, dy) <= light) |
1846 | continue; |
|
|
1847 | |
|
|
1848 | x1 = abs (x - op->x) * abs (x - op->x); |
|
|
1849 | y1 = abs (y - op->y) * abs (y - op->y); |
|
|
1850 | if (isqrt (x1 + y1) < GET_MAP_LIGHT (m, nx, ny)) |
|
|
1851 | return 1; |
1847 | return 1; |
1852 | } |
1848 | } |
1853 | } |
|
|
1854 | } |
1849 | } |
1855 | |
1850 | |
1856 | return 0; |
1851 | return 0; |
1857 | } |
1852 | } |
1858 | |
1853 | |
… | |
… | |
1882 | { |
1877 | { |
1883 | /* HIDDEN ENEMY. by definition, you can't see hidden stuff! |
1878 | /* HIDDEN ENEMY. by definition, you can't see hidden stuff! |
1884 | * However,if you carry any source of light, then the hidden |
1879 | * However,if you carry any source of light, then the hidden |
1885 | * creature is seeable (and stupid) */ |
1880 | * creature is seeable (and stupid) */ |
1886 | |
1881 | |
1887 | if (has_carried_lights (enemy)) |
1882 | if (enemy->has_carried_lights ()) |
1888 | { |
1883 | { |
1889 | if (enemy->hide) |
1884 | if (enemy->flag [FLAG_HIDDEN]) |
1890 | { |
1885 | { |
1891 | make_visible (enemy); |
1886 | make_visible (enemy); |
1892 | new_draw_info (NDI_UNIQUE, 0, enemy, "Your light reveals your hiding spot!"); |
1887 | new_draw_info (NDI_UNIQUE, 0, enemy, "Your light reveals your hiding spot!"); |
1893 | } |
1888 | } |
|
|
1889 | |
1894 | return 1; |
1890 | return 1; |
1895 | } |
1891 | } |
1896 | else if (enemy->hide) |
1892 | else if (enemy->flag [FLAG_HIDDEN]) |
1897 | return 0; |
1893 | return 0; |
1898 | |
1894 | |
1899 | /* Invisible enemy. Break apart the check for invis undead/invis looker |
1895 | /* Invisible enemy. Break apart the check for invis undead/invis looker |
1900 | * into more simple checks - the QUERY_FLAG doesn't return 1/0 values, |
1896 | * into more simple checks - the QUERY_FLAG doesn't return 1/0 values, |
1901 | * and making it a conditional makes the code pretty ugly. |
1897 | * and making it a conditional makes the code pretty ugly. |
1902 | */ |
1898 | */ |
1903 | if (!QUERY_FLAG (looker, FLAG_SEE_INVISIBLE)) |
1899 | if (!QUERY_FLAG (looker, FLAG_SEE_INVISIBLE)) |
1904 | { |
|
|
1905 | if (makes_invisible_to (enemy, looker)) |
1900 | if (makes_invisible_to (enemy, looker)) |
1906 | return 0; |
1901 | return 0; |
1907 | } |
|
|
1908 | } |
1902 | } |
1909 | else if (looker->type == PLAYER) /* for players, a (possible) shortcut */ |
1903 | else if (looker->is_player ()) /* for players, a (possible) shortcut */ |
1910 | if (player_can_view (looker, enemy)) |
1904 | if (player_can_view (looker, enemy)) |
1911 | return 1; |
1905 | return 1; |
1912 | |
1906 | |
1913 | /* ENEMY IN DARK MAP. Without infravision, the enemy is not seen |
1907 | /* ENEMY IN DARK MAP. Without infravision, the enemy is not seen |
1914 | * unless they carry a light or stand in light. Darkness doesnt |
1908 | * unless they carry a light or stand in light. Darkness doesnt |
… | |
… | |
1917 | * we care about the enemy maps status, not the looker. |
1911 | * we care about the enemy maps status, not the looker. |
1918 | * only relevant for tiled maps, but it is possible that the |
1912 | * only relevant for tiled maps, but it is possible that the |
1919 | * enemy is on a bright map and the looker on a dark - in that |
1913 | * enemy is on a bright map and the looker on a dark - in that |
1920 | * case, the looker can still see the enemy |
1914 | * case, the looker can still see the enemy |
1921 | */ |
1915 | */ |
1922 | if (enemy->map->darkness > 0 && !stand_in_light (enemy) |
1916 | if (!stand_in_light (enemy) |
1923 | && (!QUERY_FLAG (looker, FLAG_SEE_IN_DARK) || !is_true_undead (looker) || !QUERY_FLAG (looker, FLAG_XRAYS))) |
1917 | && (!QUERY_FLAG (looker, FLAG_SEE_IN_DARK) || !is_true_undead (looker) || !QUERY_FLAG (looker, FLAG_XRAYS))) |
1924 | return 0; |
1918 | return 0; |
1925 | |
1919 | |
1926 | return 1; |
1920 | return 1; |
1927 | } |
1921 | } |
|
|
1922 | |