sail/dr_2.c

   1 /*      $NetBSD: dr_2.c,v 1.21 2009/03/14 17:10:01 dholland 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. Neither the name of the University nor the names of its contributors
  16  *    may be used to endorse or promote products derived from this software
  17  *    without specific prior written permission.
  18  *
  19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  29  * SUCH DAMAGE.
  30  */
  31
  32 #include <sys/cdefs.h>
  33 #ifndef lint
  34 #if 0
  35 static char sccsid[] = "@(#)dr_2.c      8.1 (Berkeley) 5/31/93";
  36 #else
  37 __RCSID("$NetBSD: dr_2.c,v 1.21 2009/03/14 17:10:01 dholland Exp $");
  38 #endif
  39 #endif /* not lint */
  40
  41 #include <stdbool.h>
  42 #include <stdio.h>
  43 #include <stdlib.h>
  44 #include <string.h>
  45 #include "extern.h"
  46 #include "driver.h"
  47
  48 #define couldwin(f,t) (f->specs->crew2 > t->specs->crew2 * 1.5)
  49
  50 static int      str_end(const char *);
  51 static int      score(struct ship *, struct ship *, char *, int);
  52 static void     move_ship(struct ship *, const char *, unsigned char *, short *, short *, int *);
  53 static void     try(struct ship *, struct ship *, char *, char *, int, int, int, int, int, int *, int);
  54 static void     rmend(char *);
  55
  56 const int dtab[] = {0,1,1,2,3,4,4,5};   /* diagonal distances in x==y */
  57
  58 void
  59 thinkofgrapples(void)
  60 {
  61         struct ship *sp, *sq;
  62         bool friendly;
  63
  64         foreachship(sp) {
  65                 if (sp->file->captain[0] || sp->file->dir == 0)
  66                         continue;
  67                 foreachship(sq) {
  68                         friendly = sp->nationality == capship(sq)->nationality;
  69                         if (!friendly) {
  70                                 if (sp->file->struck || sp->file->captured != 0)
  71                                         continue;
  72                                 if (range(sp, sq) != 1)
  73                                         continue;
  74                                 if (grappled2(sp, sq)) {
  75                                         if (is_toughmelee(sp, sq, 0, 0))
  76                                                 ungrap(sp, sq);
  77                                         else
  78                                                 grap(sp, sq);
  79                                 } else if (couldwin(sp, sq)) {
  80                                         grap(sp, sq);
  81                                         sp->file->loadwith = L_GRAPE;
  82                                 }
  83                         } else
  84                                 ungrap(sp, sq);
  85                 }
  86         }
  87 }
  88
  89 void
  90 checkup(void)
  91 {
  92         struct ship *sp, *sq;
  93         char explode, sink;
  94
  95         foreachship(sp) {
  96                 if (sp->file->dir == 0)
  97                         continue;
  98                 explode = sp->file->explode;
  99                 sink = sp->file->sink;
 100                 if (explode != 1 && sink != 1)
 101                         continue;
 102                 if (dieroll() < 5)
 103                         continue;
 104                 Write(sink == 1 ? W_SINK : W_EXPLODE, sp, 2, 0, 0, 0);
 105                 Write(W_DIR, sp, 0, 0, 0, 0);
 106                 if (snagged(sp))
 107                         foreachship(sq)
 108                                 cleansnag(sp, sq, 1);
 109                 if (sink != 1) {
 110                         makemsg(sp, "exploding!");
 111                         foreachship(sq) {
 112                                 if (sp != sq && sq->file->dir && range(sp, sq) < 4)
 113                                         table(sp, sq, RIGGING, L_EXPLODE, sp->specs->guns/13, 6);
 114                         }
 115                 } else
 116                         makemsg(sp, "sinking!");
 117         }
 118 }
 119
 120 void
 121 prizecheck(void)
 122 {
 123         struct ship *sp;
 124
 125         foreachship(sp) {
 126                 if (sp->file->captured == 0)
 127                         continue;
 128                 if (sp->file->struck || sp->file->dir == 0)
 129                         continue;
 130                 if (sp->specs->crew1 + sp->specs->crew2 + sp->specs->crew3 > sp->file->pcrew * 6) {
 131                         Writestr(W_SIGNAL, sp, "prize crew overthrown");
 132                         Write(W_POINTS, sp->file->captured, sp->file->captured->file->points - 2 * sp->specs->pts, 0, 0, 0);
 133                         Write(W_CAPTURED, sp, -1, 0, 0, 0);
 134                 }
 135         }
 136 }
 137
 138 static int
 139 str_end(const char *str)
 140 {
 141         const char *p;
 142
 143         for (p = str; *p; p++)
 144                 ;
 145         return p == str ? 0 : p[-1];
 146 }
 147
 148 void
 149 closeon(struct ship *from, struct ship *to, char *command, int ta, int ma, int af)
 150 {
 151         int high;
 152         char temp[10];
 153
 154         temp[0] = command[0] = '\0';
 155         high = -30000;
 156         try(from, to, command, temp, ma, ta, af, ma, from->file->dir, &high, 0);
 157 }
 158
 159 static int
 160 score(struct ship *ship, struct ship *to, char *movement, int onlytemp)
 161 {
 162         int drift;
 163         int row, col, dir, total, ran;
 164         struct File *fp = ship->file;
 165
 166         if ((dir = fp->dir) == 0)
 167                 return 0;
 168         row = fp->row;
 169         col = fp->col;
 170         drift = fp->drift;
 171         move_ship(ship, movement, &fp->dir, &fp->row, &fp->col, &drift);
 172         if (!*movement)
 173                 strcpy(movement, "d");
 174
 175         ran = range(ship, to);
 176         total = -50 * ran;
 177         if (ran < 4 && gunsbear(ship, to))
 178                 total += 60;
 179         if ((ran = portside(ship, to, 1) - fp->dir) == 4 || ran == -4)
 180                 total = -30000;
 181
 182         if (!onlytemp) {
 183                 fp->row = row;
 184                 fp->col = col;
 185                 fp->dir = dir;
 186         }
 187         return total;
 188 }
 189
 190 static void
 191 move_ship(struct ship *ship, const char *p, unsigned char *dir, short *row, short *col, int *drift)
 192 {
 193         int dist;
 194         char moved = 0;
 195
 196         for (; *p; p++) {
 197                 switch (*p) {
 198                 case 'r':
 199                         if (++*dir == 9)
 200                                 *dir = 1;
 201                         break;
 202                 case 'l':
 203                         if (--*dir == 0)
 204                                 *dir = 8;
 205                         break;
 206                 case '1': case '2': case '3': case '4':
 207                 case '5': case '6': case '7':
 208                         moved++;
 209                         if (*dir % 2 == 0)
 210                                 dist = dtab[*p - '0'];
 211                         else
 212                                 dist = *p - '0';
 213                         *row -= dr[*dir] * dist;
 214                         *col -= dc[*dir] * dist;
 215                         break;
 216                 }
 217         }
 218         if (!moved) {
 219                 if (windspeed != 0 && ++*drift > 2) {
 220                         if ((ship->specs->class >= 3 && !snagged(ship))
 221                             || (turn & 1) == 0) {
 222                                 *row -= dr[winddir];
 223                                 *col -= dc[winddir];
 224                         }
 225                 }
 226         } else
 227                 *drift = 0;
 228 }
 229
 230 static void
 231 try(struct ship *f, struct ship *t, char *command, char *temp, int ma, int ta, int af, int vma, int dir, int *high, int rakeme)
 232 {
 233         int new, n;
 234         char st[4];
 235 #define rakeyou (gunsbear(f, t) && !gunsbear(t, f))
 236
 237         if ((n = str_end(temp)) < '1' || n > '9')
 238                 for (n = 1; vma - n >= 0; n++) {
 239                         sprintf(st, "%d", n);
 240                         strcat(temp, st);
 241                         new = score(f, t, temp, rakeme);
 242                         if (new > *high && (!rakeme || rakeyou)) {
 243                                 *high = new;
 244                                 strcpy(command, temp);
 245                         }
 246                         try(f, t, command, temp, ma-n, ta, af, vma-n,
 247                                 dir, high, rakeme);
 248                         rmend(temp);
 249                 }
 250         if ((ma > 0 && ta > 0 && (n = str_end(temp)) != 'l' && n != 'r') || !strlen(temp)) {
 251                 strcat(temp, "r");
 252                 new = score(f, t, temp, rakeme);
 253                 if (new > *high && (!rakeme || (gunsbear(f, t) && !gunsbear(t, f)))) {
 254                         *high = new;
 255                         strcpy(command, temp);
 256                 }
 257                 try(f, t, command, temp, ma-1, ta-1, af, min(ma-1, maxmove(f, (dir == 8 ? 1 : dir+1), 0)), (dir == 8 ? 1 : dir+1), high, rakeme);
 258                 rmend(temp);
 259         }
 260         if ((ma > 0 && ta > 0 && (n = str_end(temp)) != 'l' && n != 'r') || !strlen(temp)){
 261                 strcat(temp, "l");
 262                 new = score(f, t, temp, rakeme);
 263                 if (new > *high && (!rakeme || (gunsbear(f, t) && !gunsbear(t, f)))){
 264                         *high = new;
 265                         strcpy(command, temp);
 266                 }
 267                 try(f, t, command, temp, ma-1, ta-1, af, (min(ma-1,maxmove(f, (dir-1 ? dir-1 : 8), 0))), (dir-1 ? dir -1 : 8), high, rakeme);
 268                 rmend(temp);
 269         }
 270 }
 271
 272 static void
 273 rmend(char *str)
 274 {
 275         char *p;
 276
 277         for (p = str; *p; p++)
 278                 ;
 279         if (p != str)
 280                 *--p = 0;
 281 }