1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
|
/* $OpenBSD: dr_3.c,v 1.4 2003/06/03 03:01:41 millert Exp $ */
/* $NetBSD: dr_3.c,v 1.3 1995/04/22 10:36:49 cgd Exp $ */
/*
* Copyright (c) 1983, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifndef lint
#if 0
static char sccsid[] = "@(#)dr_3.c 8.1 (Berkeley) 5/31/93";
#else
static char rcsid[] = "$OpenBSD: dr_3.c,v 1.4 2003/06/03 03:01:41 millert Exp $";
#endif
#endif /* not lint */
#include "driver.h"
#include <stdlib.h>
void
moveall() /* move all comp ships */
{
struct ship *sp, *sq; /* r11, r10 */
int n; /* r9 */
int k, l; /* r8, r7 */
int row[NSHIP], col[NSHIP], dir[NSHIP], drift[NSHIP];
char moved[NSHIP];
/*
* first try to create moves for OUR ships
*/
foreachship(sp) {
struct ship *closest;
int ma, ta;
char af;
if (sp->file->captain[0] || sp->file->dir == 0)
continue;
if (!sp->file->struck && windspeed && !snagged(sp)
&& sp->specs->crew3) {
ta = maxturns(sp, &af);
ma = maxmove(sp, sp->file->dir, 0);
closest = closestenemy(sp, 0, 0);
if (closest == 0)
*sp->file->movebuf = '\0';
else
closeon(sp, closest, sp->file->movebuf,
sizeof sp->file->movebuf,
ta, ma, af);
} else
*sp->file->movebuf = '\0';
}
/*
* Then execute the moves for ALL ships (dead ones too),
* checking for collisions and snags at each step.
* The old positions are saved in row[], col[], dir[].
* At the end, we compare and write out the changes.
*/
n = 0;
foreachship(sp) {
if (snagged(sp))
(void) strlcpy(sp->file->movebuf, "d",
sizeof sp->file->movebuf);
else
if (*sp->file->movebuf != 'd')
(void) strlcat(sp->file->movebuf, "d",
sizeof sp->file->movebuf);
row[n] = sp->file->row;
col[n] = sp->file->col;
dir[n] = sp->file->dir;
drift[n] = sp->file->drift;
moved[n] = 0;
n++;
}
/*
* Now resolve collisions.
* This is the tough part.
*/
for (k = 0; stillmoving(k); k++) {
/*
* Step once.
* And propagate the nulls at the end of sp->file->movebuf.
*/
n = 0;
foreachship(sp) {
if (!sp->file->movebuf[k])
sp->file->movebuf[k+1] = '\0';
else if (sp->file->dir)
step(sp->file->movebuf[k], sp, &moved[n]);
n++;
}
/*
* The real stuff.
*/
n = 0;
foreachship(sp) {
if (sp->file->dir == 0 || is_isolated(sp))
goto cont1;
l = 0;
foreachship(sq) {
char snap = 0;
if (sp == sq)
goto cont2;
if (sq->file->dir == 0)
goto cont2;
if (!push(sp, sq))
goto cont2;
if (snagged2(sp, sq) && range(sp, sq) > 1)
snap++;
if (!range(sp, sq) && !fouled2(sp, sq)) {
makesignal(sp, "collision with $$", sq);
if (die() < 4) {
makesignal(sp, "fouled with $$",
sq);
Write(W_FOUL, sp, l, 0, 0, 0);
Write(W_FOUL, sq, n, 0, 0, 0);
}
snap++;
}
if (snap) {
sp->file->movebuf[k + 1] = 0;
sq->file->movebuf[k + 1] = 0;
sq->file->row = sp->file->row - 1;
if (sp->file->dir == 1
|| sp->file->dir == 5)
sq->file->col =
sp->file->col - 1;
else
sq->file->col = sp->file->col;
sq->file->dir = sp->file->dir;
}
cont2:
l++;
}
cont1:
n++;
}
}
/*
* Clear old moves. And write out new pos.
*/
n = 0;
foreachship(sp) {
if (sp->file->dir != 0) {
*sp->file->movebuf = 0;
if (row[n] != sp->file->row)
Write(W_ROW, sp, sp->file->row, 0, 0, 0);
if (col[n] != sp->file->col)
Write(W_COL, sp, sp->file->col, 0, 0, 0);
if (dir[n] != sp->file->dir)
Write(W_DIR, sp, sp->file->dir, 0, 0, 0);
if (drift[n] != sp->file->drift)
Write(W_DRIFT, sp, sp->file->drift, 0, 0, 0);
}
n++;
}
}
int
stillmoving(k)
int k;
{
struct ship *sp;
foreachship(sp)
if (sp->file->movebuf[k])
return 1;
return 0;
}
int
is_isolated(ship)
struct ship *ship;
{
struct ship *sp;
foreachship(sp) {
if (ship != sp && range(ship, sp) <= 10)
return 0;
}
return 1;
}
int
push(from, to)
struct ship *from, *to;
{
int bs, sb;
sb = to->specs->guns;
bs = from->specs->guns;
if (sb > bs)
return 1;
if (sb < bs)
return 0;
return from < to;
}
void
step(com, sp, moved)
char com;
struct ship *sp;
char *moved;
{
int dist;
switch (com) {
case 'r':
if (++sp->file->dir == 9)
sp->file->dir = 1;
break;
case 'l':
if (--sp->file->dir == 0)
sp->file->dir = 8;
break;
case '0': case '1': case '2': case '3':
case '4': case '5': case '6': case '7':
if (sp->file->dir % 2 == 0)
dist = dtab[com - '0'];
else
dist = com - '0';
sp->file->row -= dr[sp->file->dir] * dist;
sp->file->col -= dc[sp->file->dir] * dist;
*moved = 1;
break;
case 'b':
break;
case 'd':
if (!*moved) {
if (windspeed != 0 && ++sp->file->drift > 2 &&
((sp->specs->class >= 3 && !snagged(sp))
|| (turn & 1) == 0)) {
sp->file->row -= dr[winddir];
sp->file->col -= dc[winddir];
}
} else
sp->file->drift = 0;
break;
}
}
void
sendbp(from, to, sections, isdefense)
struct ship *from, *to;
int sections;
char isdefense;
{
int n;
struct BP *bp;
bp = isdefense ? from->file->DBP : from->file->OBP;
for (n = 0; n < NBP && bp[n].turnsent; n++)
;
if (n < NBP && sections) {
Write(isdefense ? W_DBP : W_OBP, from,
n, turn, to->file->index, sections);
if (isdefense)
makemsg(from, "repelling boarders");
else
makesignal(from, "boarding the $$", to);
}
}
int
is_toughmelee(ship, to, isdefense, count)
struct ship *ship, *to;
int isdefense, count;
{
struct BP *bp;
int obp = 0;
int n, OBP = 0, DBP = 0, dbp = 0;
int qual;
qual = ship->specs->qual;
bp = isdefense ? ship->file->DBP : ship->file->OBP;
for (n = 0; n < NBP; n++, bp++) {
if (bp->turnsent && (to == bp->toship || isdefense)) {
obp += bp->mensent / 100
? ship->specs->crew1 * qual : 0;
obp += (bp->mensent % 100)/10
? ship->specs->crew2 * qual : 0;
obp += bp->mensent % 10
? ship->specs->crew3 * qual : 0;
}
}
if (count || isdefense)
return obp;
OBP = is_toughmelee(to, ship, 0, count + 1);
dbp = is_toughmelee(ship, to, 1, count + 1);
DBP = is_toughmelee(to, ship, 1, count + 1);
if (OBP > obp + 10 || OBP + DBP >= obp + dbp + 10)
return 1;
else
return 0;
}
void
reload()
{
struct ship *sp;
foreachship(sp) {
sp->file->loadwith = 0;
}
}
void
checksails()
{
struct ship *sp;
int rig, full;
struct ship *close;
foreachship(sp) {
if (sp->file->captain[0] != 0)
continue;
rig = sp->specs->rig1;
if (windspeed == 6 || (windspeed == 5 && sp->specs->class > 4))
rig = 0;
if (rig && sp->specs->crew3) {
close = closestenemy(sp, 0, 0);
if (close != 0) {
if (range(sp, close) > 9)
full = 1;
else
full = 0;
} else
full = 0;
} else
full = 0;
if ((sp->file->FS != 0) != full)
Write(W_FS, sp, full, 0, 0, 0);
}
}
|
