games/trek/klmove.c

   1 /*
   2  * Copyright (c) 1980, 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * Redistribution and use in source and binary forms, with or without
   6  * modification, are permitted provided that the following conditions
   7  * are met:
   8  * 1. Redistributions of source code must retain the above copyright
   9  *    notice, this list of conditions and the following disclaimer.
  10  * 2. Redistributions in binary form must reproduce the above copyright
  11  *    notice, this list of conditions and the following disclaimer in the
  12  *    documentation and/or other materials provided with the distribution.
  13  * 3. All advertising materials mentioning features or use of this software
  14  *    must display the following acknowledgement:
  15  *      This product includes software developed by the University of
  16  *      California, Berkeley and its contributors.
  17  * 4. Neither the name of the University nor the names of its contributors
  18  *    may be used to endorse or promote products derived from this software
  19  *    without specific prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31  * SUCH DAMAGE.
  32  *
  33  * @(#)klmove.c 8.1 (Berkeley) 5/31/93
  34  * $FreeBSD: src/games/trek/klmove.c,v 1.4 1999/11/30 03:49:49 billf Exp $
  35  * $DragonFly: src/games/trek/klmove.c,v 1.3 2006/09/07 21:19:44 pavalos Exp $
  36  */
  37
  38 # include       "trek.h"
  39
  40 /*
  41 **  Move Klingons Around
  42 **
  43 **      This is a largely incomprehensible block of code that moves
  44 **      Klingons around in a quadrant.  It was written in a very
  45 **      "program as you go" fashion, and is a prime candidate for
  46 **      rewriting.
  47 **
  48 **      The flag `fl' is zero before an attack, one after an attack,
  49 **      and two if you are leaving a quadrant.  This serves to
  50 **      change the probability and distance that it moves.
  51 **
  52 **      Basically, what it will try to do is to move a certain number
  53 **      of steps either toward you or away from you.  It will avoid
  54 **      stars whenever possible.  Nextx and nexty are the next
  55 **      sector to move to on a per-Klingon basis; they are roughly
  56 **      equivalent to Ship.sectx and Ship.secty for the starship.  Lookx and
  57 **      looky are the sector that you are going to look at to see
  58 **      if you can move their.  Dx and dy are the increment.  Fudgex
  59 **      and fudgey are the things you change around to change your
  60 **      course around stars.
  61 */
  62
  63 void
  64 klmove(int fl)
  65 {
  66         int                     n;
  67         struct kling    *k;
  68         double                  dx, dy;
  69         int                     nextx, nexty;
  70         int             lookx, looky;
  71         int                     motion;
  72         int                     fudgex, fudgey;
  73         int                     qx, qy;
  74         double                  bigger;
  75         int                     i;
  76
  77 #       ifdef xTRACE
  78         if (Trace)
  79                 printf("klmove: fl = %d, Etc.nkling = %d\n", fl, Etc.nkling);
  80 #       endif
  81         for (n = 0; n < Etc.nkling; k && n++)
  82         {
  83                 k = &Etc.klingon[n];
  84                 i = 100;
  85                 if (fl)
  86                         i = 100.0 * k->power / Param.klingpwr;
  87                 if (ranf(i) >= Param.moveprob[2 * Move.newquad + fl])
  88                         continue;
  89                 /* compute distance to move */
  90                 motion = ranf(75) - 25;
  91                 motion *= k->avgdist * Param.movefac[2 * Move.newquad + fl];
  92                 /* compute direction */
  93                 dx = Ship.sectx - k->x + ranf(3) - 1;
  94                 dy = Ship.secty - k->y + ranf(3) - 1;
  95                 bigger = dx;
  96                 if (dy > bigger)
  97                         bigger = dy;
  98                 if (bigger == 0.0)
  99                         bigger = 1.0;
 100                 dx = dx / bigger + 0.5;
 101                 dy = dy / bigger + 0.5;
 102                 if (motion < 0)
 103                 {
 104                         motion = -motion;
 105                         dx = -dx;
 106                         dy = -dy;
 107                 }
 108                 fudgex = fudgey = 1;
 109                 /* try to move the klingon */
 110                 nextx = k->x;
 111                 nexty = k->y;
 112                 for (; motion > 0; motion--)
 113                 {
 114                         lookx = nextx + dx;
 115                         looky = nexty + dy;
 116                         if (lookx < 0 || lookx >= NSECTS || looky < 0 || looky >= NSECTS)
 117                         {
 118                                 /* new quadrant */
 119                                 qx = Ship.quadx;
 120                                 qy = Ship.quady;
 121                                 if (lookx < 0)
 122                                         qx -= 1;
 123                                 else
 124                                         if (lookx >= NSECTS)
 125                                                 qx += 1;
 126                                 if (looky < 0)
 127                                         qy -= 1;
 128                                 else
 129                                         if (looky >= NSECTS)
 130                                                 qy += 1;
 131                                 if (qx < 0 || qx >= NQUADS || qy < 0 || qy >= NQUADS ||
 132                                                 Quad[qx][qy].stars < 0 || Quad[qx][qy].klings > MAXKLQUAD - 1)
 133                                         break;
 134                                 if (!damaged(SRSCAN))
 135                                 {
 136                                         printf("Klingon at %d,%d escapes to quadrant %d,%d\n",
 137                                                 k->x, k->y, qx, qy);
 138                                         motion = Quad[qx][qy].scanned;
 139                                         if (motion >= 0 && motion < 1000)
 140                                                 Quad[qx][qy].scanned += 100;
 141                                         motion = Quad[Ship.quadx][Ship.quady].scanned;
 142                                         if (motion >= 0 && motion < 1000)
 143                                                 Quad[Ship.quadx][Ship.quady].scanned -= 100;
 144                                 }
 145                                 Sect[k->x][k->y] = EMPTY;
 146                                 Quad[qx][qy].klings += 1;
 147                                 Etc.nkling -= 1;
 148                                 bmove(&Etc.klingon[Etc.nkling], k, sizeof *k);
 149                                 Quad[Ship.quadx][Ship.quady].klings -= 1;
 150                                 k = 0;
 151                                 break;
 152                         }
 153                         if (Sect[lookx][looky] != EMPTY)
 154                         {
 155                                 lookx = nextx + fudgex;
 156                                 if (lookx < 0 || lookx >= NSECTS)
 157                                         lookx = nextx + dx;
 158                                 if (Sect[lookx][looky] != EMPTY)
 159                                 {
 160                                         fudgex = -fudgex;
 161                                         looky = nexty + fudgey;
 162                                         if (looky < 0 || looky >= NSECTS || Sect[lookx][looky] != EMPTY)
 163                                         {
 164                                                 fudgey = -fudgey;
 165                                                 break;
 166                                         }
 167                                 }
 168                         }
 169                         nextx = lookx;
 170                         nexty = looky;
 171                 }
 172                 if (k && (k->x != nextx || k->y != nexty))
 173                 {
 174                         if (!damaged(SRSCAN))
 175                                 printf("Klingon at %d,%d moves to %d,%d\n",
 176                                         k->x, k->y, nextx, nexty);
 177                         Sect[k->x][k->y] = EMPTY;
 178                         Sect[k->x = nextx][k->y = nexty] = KLINGON;
 179                 }
 180         }
 181         compkldist(0);
 182 }