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 34 #ifndef lint 35 #if 0 36 static char sccsid[] = "@(#)klmove.c 8.1 (Berkeley) 5/31/93"; 37 #endif 38 static const char rcsid[] = 39 "$FreeBSD: src/games/trek/klmove.c,v 1.4 1999/11/30 03:49:49 billf Exp $"; 40 #endif /* not lint */ 41 42 # include "trek.h" 43 44 /* 45 ** Move Klingons Around 46 ** 47 ** This is a largely incomprehensible block of code that moves 48 ** Klingons around in a quadrant. It was written in a very 49 ** "program as you go" fashion, and is a prime candidate for 50 ** rewriting. 51 ** 52 ** The flag `fl' is zero before an attack, one after an attack, 53 ** and two if you are leaving a quadrant. This serves to 54 ** change the probability and distance that it moves. 55 ** 56 ** Basically, what it will try to do is to move a certain number 57 ** of steps either toward you or away from you. It will avoid 58 ** stars whenever possible. Nextx and nexty are the next 59 ** sector to move to on a per-Klingon basis; they are roughly 60 ** equivalent to Ship.sectx and Ship.secty for the starship. Lookx and 61 ** looky are the sector that you are going to look at to see 62 ** if you can move their. Dx and dy are the increment. Fudgex 63 ** and fudgey are the things you change around to change your 64 ** course around stars. 65 */ 66 67 klmove(fl) 68 int fl; 69 { 70 int n; 71 struct kling *k; 72 double dx, dy; 73 int nextx, nexty; 74 int lookx, looky; 75 int motion; 76 int fudgex, fudgey; 77 int qx, qy; 78 double bigger; 79 int i; 80 81 # ifdef xTRACE 82 if (Trace) 83 printf("klmove: fl = %d, Etc.nkling = %d\n", fl, Etc.nkling); 84 # endif 85 for (n = 0; n < Etc.nkling; k && n++) 86 { 87 k = &Etc.klingon[n]; 88 i = 100; 89 if (fl) 90 i = 100.0 * k->power / Param.klingpwr; 91 if (ranf(i) >= Param.moveprob[2 * Move.newquad + fl]) 92 continue; 93 /* compute distance to move */ 94 motion = ranf(75) - 25; 95 motion *= k->avgdist * Param.movefac[2 * Move.newquad + fl]; 96 /* compute direction */ 97 dx = Ship.sectx - k->x + ranf(3) - 1; 98 dy = Ship.secty - k->y + ranf(3) - 1; 99 bigger = dx; 100 if (dy > bigger) 101 bigger = dy; 102 if (bigger == 0.0) 103 bigger = 1.0; 104 dx = dx / bigger + 0.5; 105 dy = dy / bigger + 0.5; 106 if (motion < 0) 107 { 108 motion = -motion; 109 dx = -dx; 110 dy = -dy; 111 } 112 fudgex = fudgey = 1; 113 /* try to move the klingon */ 114 nextx = k->x; 115 nexty = k->y; 116 for (; motion > 0; motion--) 117 { 118 lookx = nextx + dx; 119 looky = nexty + dy; 120 if (lookx < 0 || lookx >= NSECTS || looky < 0 || looky >= NSECTS) 121 { 122 /* new quadrant */ 123 qx = Ship.quadx; 124 qy = Ship.quady; 125 if (lookx < 0) 126 qx -= 1; 127 else 128 if (lookx >= NSECTS) 129 qx += 1; 130 if (looky < 0) 131 qy -= 1; 132 else 133 if (looky >= NSECTS) 134 qy += 1; 135 if (qx < 0 || qx >= NQUADS || qy < 0 || qy >= NQUADS || 136 Quad[qx][qy].stars < 0 || Quad[qx][qy].klings > MAXKLQUAD - 1) 137 break; 138 if (!damaged(SRSCAN)) 139 { 140 printf("Klingon at %d,%d escapes to quadrant %d,%d\n", 141 k->x, k->y, qx, qy); 142 motion = Quad[qx][qy].scanned; 143 if (motion >= 0 && motion < 1000) 144 Quad[qx][qy].scanned += 100; 145 motion = Quad[Ship.quadx][Ship.quady].scanned; 146 if (motion >= 0 && motion < 1000) 147 Quad[Ship.quadx][Ship.quady].scanned -= 100; 148 } 149 Sect[k->x][k->y] = EMPTY; 150 Quad[qx][qy].klings += 1; 151 Etc.nkling -= 1; 152 bmove(&Etc.klingon[Etc.nkling], k, sizeof *k); 153 Quad[Ship.quadx][Ship.quady].klings -= 1; 154 k = 0; 155 break; 156 } 157 if (Sect[lookx][looky] != EMPTY) 158 { 159 lookx = nextx + fudgex; 160 if (lookx < 0 || lookx >= NSECTS) 161 lookx = nextx + dx; 162 if (Sect[lookx][looky] != EMPTY) 163 { 164 fudgex = -fudgex; 165 looky = nexty + fudgey; 166 if (looky < 0 || looky >= NSECTS || Sect[lookx][looky] != EMPTY) 167 { 168 fudgey = -fudgey; 169 break; 170 } 171 } 172 } 173 nextx = lookx; 174 nexty = looky; 175 } 176 if (k && (k->x != nextx || k->y != nexty)) 177 { 178 if (!damaged(SRSCAN)) 179 printf("Klingon at %d,%d moves to %d,%d\n", 180 k->x, k->y, nextx, nexty); 181 Sect[k->x][k->y] = EMPTY; 182 Sect[k->x = nextx][k->y = nexty] = KLINGON; 183 } 184 } 185 compkldist(0); 186 } 187