games/sail/dr_2.c

   1 /*
   2  * Copyright (c) 1983, 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. 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.
  20  *
  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
  31  * SUCH DAMAGE.
  32  *
  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 $
  36  */
  37
  38 #include <string.h>
  39 #include "driver.h"
  40
  41 #define couldwin(f,t) (f->specs->crew2 > t->specs->crew2 * 1.5)
  42
  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 *);
  48
  49 void
  50 thinkofgrapples(void)
  51 {
  52         struct ship *sp, *sq;
  53         char friendly;
  54
  55         foreachship(sp) {
  56                 if (sp->file->captain[0] || sp->file->dir == 0)
  57                         continue;
  58                 foreachship(sq) {
  59                         friendly = sp->nationality == capship(sq)->nationality;
  60                         if (!friendly) {
  61                                 if (sp->file->struck || sp->file->captured != 0)
  62                                         continue;
  63                                 if (range(sp, sq) != 1)
  64                                         continue;
  65                                 if (grappled2(sp, sq))
  66                                         if (toughmelee(sp, sq, 0, 0))
  67                                                 ungrap(sp, sq);
  68                                         else
  69                                                 grap(sp, sq);
  70                                 else if (couldwin(sp, sq)) {
  71                                         grap(sp, sq);
  72                                         sp->file->loadwith = L_GRAPE;
  73                                 }
  74                         } else
  75                                 ungrap(sp, sq);
  76                 }
  77         }
  78 }
  79
  80 void
  81 checkup(void)
  82 {
  83         struct ship *sp, *sq;
  84         char explode, sink;
  85
  86         foreachship(sp) {
  87                 if (sp->file->dir == 0)
  88                         continue;
  89                 explode = sp->file->explode;
  90                 sink = sp->file->sink;
  91                 if (explode != 1 && sink != 1)
  92                         continue;
  93                 if (die() < 5)
  94                         continue;
  95                 Write(sink == 1 ? W_SINK : W_EXPLODE, sp, 0, 2, 0, 0, 0);
  96                 Write(W_DIR, sp, 0, 0, 0, 0, 0);
  97                 if (snagged(sp))
  98                         foreachship(sq)
  99                                 cleansnag(sp, sq, 1);
 100                 if (sink != 1) {
 101                         makesignal(sp, "exploding!", (struct ship *)0);
 102                         foreachship(sq) {
 103                                 if (sp != sq && sq->file->dir && range(sp, sq) < 4)
 104                                         table(RIGGING, L_EXPLODE, sp->specs->guns/13, sq, sp, 6);
 105                         }
 106                 } else
 107                         makesignal(sp, "sinking!", (struct ship *)0);
 108         }
 109 }
 110
 111 void
 112 prizecheck(void)
 113 {
 114         struct ship *sp;
 115
 116         foreachship(sp) {
 117                 if (sp->file->captured == 0)
 118                         continue;
 119                 if (sp->file->struck || sp->file->dir == 0)
 120                         continue;
 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);
 126                 }
 127         }
 128 }
 129
 130 static char
 131 strend(char *str)
 132 {
 133         char *p;
 134
 135         for (p = str; *p; p++)
 136                 ;
 137         return p == str ? 0 : p[-1];
 138 }
 139
 140 void
 141 closeon(struct ship *from, struct ship *to, char command[], int ta, int ma, int af)
 142 {
 143         int high;
 144         char temp[10];
 145
 146         temp[0] = command[0] = '\0';
 147         high = -30000;
 148         try(command, temp, ma, ta, af, ma, from->file->dir, from, to, &high, 0);
 149 }
 150
 151 int dtab[] = {0,1,1,2,3,4,4,5};         /* diagonal distances in x==y */
 152
 153 static int
 154 score(char movement[], struct ship *ship, struct ship *to, char onlytemp)
 155 {
 156         char drift;
 157         int row, col, dir, total, ran;
 158         struct File *fp = ship->file;
 159
 160         if ((dir = fp->dir) == 0)
 161                 return 0;
 162         row = fp->row;
 163         col = fp->col;
 164         drift = fp->drift;
 165         sail_move(movement, ship, &fp->dir, &fp->row, &fp->col, &drift);
 166         if (!*movement)
 167                 strcpy(movement, "d");
 168
 169         ran = range(ship, to);
 170         total = -50 * ran;
 171         if (ran < 4 && gunsbear(ship, to))
 172                 total += 60;
 173         if ((ran = portside(ship, to, 1) - fp->dir) == 4 || ran == -4)
 174                 total = -30000;
 175
 176         if (!onlytemp) {
 177                 fp->row = row;
 178                 fp->col = col;
 179                 fp->dir = dir;
 180         }
 181         return total;
 182 }
 183
 184 static void
 185 sail_move(char *p, struct ship *ship, unsigned char *dir, short *row, short *col, char *drift)
 186 {
 187         int dist;
 188         char moved = 0;
 189
 190         for (; *p; p++) {
 191                 switch (*p) {
 192                 case 'r':
 193                         if (++*dir == 9)
 194                                 *dir = 1;
 195                         break;
 196                 case 'l':
 197                         if (--*dir == 0)
 198                                 *dir = 8;
 199                         break;
 200                 case '1': case '2': case '3': case '4':
 201                 case '5': case '6': case '7':
 202                         moved++;
 203                         if (*dir % 2 == 0)
 204                                 dist = dtab[*p - '0'];
 205                         else
 206                                 dist = *p - '0';
 207                         *row -= dr[*dir] * dist;
 208                         *col -= dc[*dir] * dist;
 209                         break;
 210                 }
 211         }
 212         if (!moved) {
 213                 if (windspeed != 0 && ++*drift > 2) {
 214                         if ((ship->specs->class >= 3 && !snagged(ship))
 215                             || (turn & 1) == 0) {
 216                                 *row -= dr[winddir];
 217                                 *col -= dc[winddir];
 218                         }
 219                 }
 220         } else
 221                 *drift = 0;
 222 }
 223
 224 static void
 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)
 226 {
 227         int new, n;
 228         char st[4];
 229 #define rakeyou (gunsbear(f, t) && !gunsbear(t, f))
 230
 231         if ((n = strend(temp)) < '1' || n > '9')
 232                 for (n = 1; vma - n >= 0; n++) {
 233                         sprintf(st, "%d", n);
 234                         strcat(temp, st);
 235                         new = score(temp, f, t, rakeme);
 236                         if (new > *high && (!rakeme || rakeyou)) {
 237                                 *high = new;
 238                                 strcpy(command, temp);
 239                         }
 240                         try(command, temp, ma-n, ta, af, vma-n,
 241                                 dir, f, t, high, rakeme);
 242                         rmend(temp);
 243                 }
 244         if ((ma > 0 && ta > 0 && (n = strend(temp)) != 'l' && n != 'r') || !strlen(temp)) {
 245                 strcat(temp, "r");
 246                 new = score(temp, f, t, rakeme);
 247                 if (new > *high && (!rakeme || (gunsbear(f, t) && !gunsbear(t, f)))) {
 248                         *high = new;
 249                         strcpy(command, temp);
 250                 }
 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);
 252                 rmend(temp);
 253         }
 254         if ((ma > 0 && ta > 0 && (n = strend(temp)) != 'l' && n != 'r') || !strlen(temp)){
 255                 strcat(temp, "l");
 256                 new = score(temp, f, t, rakeme);
 257                 if (new > *high && (!rakeme || (gunsbear(f, t) && !gunsbear(t, f)))){
 258                         *high = new;
 259                         strcpy(command, temp);
 260                 }
 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);
 262                 rmend(temp);
 263         }
 264 }
 265
 266 static void
 267 rmend(char *str)
 268 {
 269         char *p;
 270
 271         for (p = str; *p; p++)
 272                 ;
 273         if (p != str)
 274                 *--p = 0;
 275 }