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