2 * Copyright (c) 1980, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
37 static char sccsid[] = "@(#)klmove.c 8.1 (Berkeley) 5/31/93";
43 ** Move Klingons Around
45 ** This is a largely incomprehensible block of code that moves
46 ** Klingons around in a quadrant. It was written in a very
47 ** "program as you go" fashion, and is a prime candidate for
50 ** The flag `fl' is zero before an attack, one after an attack,
51 ** and two if you are leaving a quadrant. This serves to
52 ** change the probability and distance that it moves.
54 ** Basically, what it will try to do is to move a certain number
55 ** of steps either toward you or away from you. It will avoid
56 ** stars whenever possible. Nextx and nexty are the next
57 ** sector to move to on a per-Klingon basis; they are roughly
58 ** equivalent to Ship.sectx and Ship.secty for the starship. Lookx and
59 ** looky are the sector that you are going to look at to see
60 ** if you can move their. Dx and dy are the increment. Fudgex
61 ** and fudgey are the things you change around to change your
62 ** course around stars.
81 printf("klmove: fl = %d, Etc.nkling = %d\n", fl, Etc.nkling);
83 for (n = 0; n < Etc.nkling; k && n++)
88 i = 100.0 * k->power / Param.klingpwr;
89 if (ranf(i) >= Param.moveprob[2 * Move.newquad + fl])
91 /* compute distance to move */
92 motion = ranf(75) - 25;
93 motion *= k->avgdist * Param.movefac[2 * Move.newquad + fl];
94 /* compute direction */
95 dx = Ship.sectx - k->x + ranf(3) - 1;
96 dy = Ship.secty - k->y + ranf(3) - 1;
102 dx = dx / bigger + 0.5;
103 dy = dy / bigger + 0.5;
111 /* try to move the klingon */
114 for (; motion > 0; motion--)
118 if (lookx < 0 || lookx >= NSECTS || looky < 0 || looky >= NSECTS)
133 if (qx < 0 || qx >= NQUADS || qy < 0 || qy >= NQUADS ||
134 Quad[qx][qy].stars < 0 || Quad[qx][qy].klings > MAXKLQUAD - 1)
136 if (!damaged(SRSCAN))
138 printf("Klingon at %d,%d escapes to quadrant %d,%d\n",
140 motion = Quad[qx][qy].scanned;
141 if (motion >= 0 && motion < 1000)
142 Quad[qx][qy].scanned += 100;
143 motion = Quad[Ship.quadx][Ship.quady].scanned;
144 if (motion >= 0 && motion < 1000)
145 Quad[Ship.quadx][Ship.quady].scanned -= 100;
147 Sect[k->x][k->y] = EMPTY;
148 Quad[qx][qy].klings += 1;
150 bmove(&Etc.klingon[Etc.nkling], k, sizeof *k);
151 Quad[Ship.quadx][Ship.quady].klings -= 1;
155 if (Sect[lookx][looky] != EMPTY)
157 lookx = nextx + fudgex;
158 if (lookx < 0 || lookx >= NSECTS)
160 if (Sect[lookx][looky] != EMPTY)
163 looky = nexty + fudgey;
164 if (looky < 0 || looky >= NSECTS || Sect[lookx][looky] != EMPTY)
174 if (k && (k->x != nextx || k->y != nexty))
176 if (!damaged(SRSCAN))
177 printf("Klingon at %d,%d moves to %d,%d\n",
178 k->x, k->y, nextx, nexty);
179 Sect[k->x][k->y] = EMPTY;
180 Sect[k->x = nextx][k->y = nexty] = KLINGON;