sail/dr_2.c

   1 /*      $NetBSD: dr_2.c,v 1.13 2001/01/01 21:57:37 jwise Exp $  */
   2
   3 /*
   4  * Copyright (c) 1983, 1993
   5  *      The Regents of the University of California.  All rights reserved.
   6  *
   7  * Redistribution and use in source and binary forms, with or without
   8  * modification, are permitted provided that the following conditions
   9  * are met:
  10  * 1. Redistributions of source code must retain the above copyright
  11  *    notice, this list of conditions and the following disclaimer.
  12  * 2. Redistributions in binary form must reproduce the above copyright
  13  *    notice, this list of conditions and the following disclaimer in the
  14  *    documentation and/or other materials provided with the distribution.
  15  * 3. All advertising materials mentioning features or use of this software
  16  *    must display the following acknowledgement:
  17  *      This product includes software developed by the University of
  18  *      California, Berkeley and its contributors.
  19  * 4. Neither the name of the University nor the names of its contributors
  20  *    may be used to endorse or promote products derived from this software
  21  *    without specific prior written permission.
  22  *
  23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  33  * SUCH DAMAGE.
  34  */
  35
  36 #include <sys/cdefs.h>
  37 #ifndef lint
  38 #if 0
  39 static char sccsid[] = "@(#)dr_2.c      8.1 (Berkeley) 5/31/93";
  40 #else
  41 __RCSID("$NetBSD: dr_2.c,v 1.13 2001/01/01 21:57:37 jwise Exp $");
  42 #endif
  43 #endif /* not lint */
  44
  45 #include "driver.h"
  46 #include <stdlib.h>
  47
  48 #define couldwin(f,t) (f->specs->crew2 > t->specs->crew2 * 1.5)
  49
  50 void
  51 thinkofgrapples(void)
  52 {
  53         struct ship *sp, *sq;
  54         char friendly;
  55
  56         foreachship(sp) {
  57                 if (sp->file->captain[0] || sp->file->dir == 0)
  58                         continue;
  59                 foreachship(sq) {
  60                         friendly = sp->nationality == capship(sq)->nationality;
  61                         if (!friendly) {
  62                                 if (sp->file->struck || sp->file->captured != 0)
  63                                         continue;
  64                                 if (range(sp, sq) != 1)
  65                                         continue;
  66                                 if (grappled2(sp, sq))
  67                                         if (is_toughmelee(sp, sq, 0, 0))
  68                                                 ungrap(sp, sq);
  69                                         else
  70                                                 grap(sp, sq);
  71                                 else if (couldwin(sp, sq)) {
  72                                         grap(sp, sq);
  73                                         sp->file->loadwith = L_GRAPE;
  74                                 }
  75                         } else
  76                                 ungrap(sp, sq);
  77                 }
  78         }
  79 }
  80
  81 void
  82 checkup(void)
  83 {
  84         struct ship *sp, *sq;
  85         char explode, sink;
  86
  87         foreachship(sp) {
  88                 if (sp->file->dir == 0)
  89                         continue;
  90                 explode = sp->file->explode;
  91                 sink = sp->file->sink;
  92                 if (explode != 1 && sink != 1)
  93                         continue;
  94                 if (dieroll() < 5)
  95                         continue;
  96                 Write(sink == 1 ? W_SINK : W_EXPLODE, sp, 2, 0, 0, 0);
  97                 Write(W_DIR, sp, 0, 0, 0, 0);
  98                 if (snagged(sp))
  99                         foreachship(sq)
 100                                 cleansnag(sp, sq, 1);
 101                 if (sink != 1) {
 102                         makemsg(sp, "exploding!");
 103                         foreachship(sq) {
 104                                 if (sp != sq && sq->file->dir && range(sp, sq) < 4)
 105                                         table(RIGGING, L_EXPLODE, sp->specs->guns/13, sq, sp, 6);
 106                         }
 107                 } else
 108                         makemsg(sp, "sinking!");
 109         }
 110 }
 111
 112 void
 113 prizecheck(void)
 114 {
 115         struct ship *sp;
 116
 117         foreachship(sp) {
 118                 if (sp->file->captured == 0)
 119                         continue;
 120                 if (sp->file->struck || sp->file->dir == 0)
 121                         continue;
 122                 if (sp->specs->crew1 + sp->specs->crew2 + sp->specs->crew3 > sp->file->pcrew * 6) {
 123                         Writestr(W_SIGNAL, sp, "prize crew overthrown");
 124                         Write(W_POINTS, sp->file->captured, sp->file->captured->file->points - 2 * sp->specs->pts, 0, 0, 0);
 125                         Write(W_CAPTURED, sp, -1, 0, 0, 0);
 126                 }
 127         }
 128 }
 129
 130 int
 131 str_end(const char *str)
 132 {
 133         const 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 const int dtab[] = {0,1,1,2,3,4,4,5};   /* diagonal distances in x==y */
 152
 153 int
 154 score(char *movement, struct ship *ship, struct ship *to, int 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         move_ship(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 void
 185 move_ship(const 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 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 = str_end(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 = str_end(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 = str_end(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 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 }