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