2 * Copyright (c) 1983, 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
33 * @(#)dr_2.c 8.1 (Berkeley) 5/31/93
34 * $FreeBSD: src/games/sail/dr_2.c,v 1.6 1999/11/30 03:49:32 billf Exp $
35 * $DragonFly: src/games/sail/dr_2.c,v 1.3 2006/09/03 17:33:13 pavalos Exp $
41 #define couldwin(f,t) (f->specs->crew2 > t->specs->crew2 * 1.5)
43 static char strend(char *);
44 static int score(char *, struct ship *, struct ship *, char);
45 static void sail_move(char *, struct ship *, unsigned char *, short *, short *, char *);
46 static void try(char *, char *, int, int, int, int, int, struct ship *, struct ship *, int *, int);
47 static void rmend(char *);
56 if (sp->file->captain[0] || sp->file->dir == 0)
59 friendly = sp->nationality == capship(sq)->nationality;
61 if (sp->file->struck || sp->file->captured != 0)
63 if (range(sp, sq) != 1)
65 if (grappled2(sp, sq))
66 if (toughmelee(sp, sq, 0, 0))
70 else if (couldwin(sp, sq)) {
72 sp->file->loadwith = L_GRAPE;
87 if (sp->file->dir == 0)
89 explode = sp->file->explode;
90 sink = sp->file->sink;
91 if (explode != 1 && sink != 1)
95 Write(sink == 1 ? W_SINK : W_EXPLODE, sp, 0, 2, 0, 0, 0);
96 Write(W_DIR, sp, 0, 0, 0, 0, 0);
101 makesignal(sp, "exploding!", (struct ship *)0);
103 if (sp != sq && sq->file->dir && range(sp, sq) < 4)
104 table(RIGGING, L_EXPLODE, sp->specs->guns/13, sq, sp, 6);
107 makesignal(sp, "sinking!", (struct ship *)0);
117 if (sp->file->captured == 0)
119 if (sp->file->struck || sp->file->dir == 0)
121 if (sp->specs->crew1 + sp->specs->crew2 + sp->specs->crew3 > sp->file->pcrew * 6) {
122 Write(W_SIGNAL, sp, 1,
123 (int)"prize crew overthrown", 0, 0, 0);
124 Write(W_POINTS, sp->file->captured, 0, sp->file->captured->file->points - 2 * sp->specs->pts, 0, 0, 0);
125 Write(W_CAPTURED, sp, 0, -1, 0, 0, 0);
135 for (p = str; *p; p++)
137 return p == str ? 0 : p[-1];
141 closeon(struct ship *from, struct ship *to, char command[], int ta, int ma, int af)
146 temp[0] = command[0] = '\0';
148 try(command, temp, ma, ta, af, ma, from->file->dir, from, to, &high, 0);
151 int dtab[] = {0,1,1,2,3,4,4,5}; /* diagonal distances in x==y */
154 score(char movement[], struct ship *ship, struct ship *to, char onlytemp)
157 int row, col, dir, total, ran;
158 struct File *fp = ship->file;
160 if ((dir = fp->dir) == 0)
165 sail_move(movement, ship, &fp->dir, &fp->row, &fp->col, &drift);
167 strcpy(movement, "d");
169 ran = range(ship, to);
171 if (ran < 4 && gunsbear(ship, to))
173 if ((ran = portside(ship, to, 1) - fp->dir) == 4 || ran == -4)
185 sail_move(char *p, struct ship *ship, unsigned char *dir, short *row, short *col, char *drift)
200 case '1': case '2': case '3': case '4':
201 case '5': case '6': case '7':
204 dist = dtab[*p - '0'];
207 *row -= dr[*dir] * dist;
208 *col -= dc[*dir] * dist;
213 if (windspeed != 0 && ++*drift > 2) {
214 if ((ship->specs->class >= 3 && !snagged(ship))
215 || (turn & 1) == 0) {
225 try(char command[], char temp[], int ma, int ta, int af, int vma, int dir, struct ship *f, struct ship *t, int *high, int rakeme)
229 #define rakeyou (gunsbear(f, t) && !gunsbear(t, f))
231 if ((n = strend(temp)) < '1' || n > '9')
232 for (n = 1; vma - n >= 0; n++) {
233 sprintf(st, "%d", n);
235 new = score(temp, f, t, rakeme);
236 if (new > *high && (!rakeme || rakeyou)) {
238 strcpy(command, temp);
240 try(command, temp, ma-n, ta, af, vma-n,
241 dir, f, t, high, rakeme);
244 if ((ma > 0 && ta > 0 && (n = strend(temp)) != 'l' && n != 'r') || !strlen(temp)) {
246 new = score(temp, f, t, rakeme);
247 if (new > *high && (!rakeme || (gunsbear(f, t) && !gunsbear(t, f)))) {
249 strcpy(command, temp);
251 try(command, temp, ma-1, ta-1, af, min(ma-1, maxmove(f, (dir == 8 ? 1 : dir+1), 0)), (dir == 8 ? 1 : dir+1),f,t,high,rakeme);
254 if ((ma > 0 && ta > 0 && (n = strend(temp)) != 'l' && n != 'r') || !strlen(temp)){
256 new = score(temp, f, t, rakeme);
257 if (new > *high && (!rakeme || (gunsbear(f, t) && !gunsbear(t, f)))){
259 strcpy(command, temp);
261 try(command, temp, ma-1, ta-1, af, (min(ma-1,maxmove(f, (dir-1 ? dir-1 : 8), 0))), (dir-1 ? dir -1 : 8), f, t, high, rakeme);
271 for (p = str; *p; p++)