Home | History | Annotate | Line # | Download | only in trek
      1  1.13  dholland /*	$NetBSD: help.c,v 1.13 2009/08/12 08:54:54 dholland Exp $	*/
      2   1.3       cgd 
      3   1.1       cgd /*
      4   1.3       cgd  * Copyright (c) 1980, 1993
      5   1.3       cgd  *	The Regents of the University of California.  All rights reserved.
      6   1.1       cgd  *
      7   1.1       cgd  * Redistribution and use in source and binary forms, with or without
      8   1.1       cgd  * modification, are permitted provided that the following conditions
      9   1.1       cgd  * are met:
     10   1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     11   1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     12   1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13   1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     14   1.1       cgd  *    documentation and/or other materials provided with the distribution.
     15   1.7       agc  * 3. Neither the name of the University nor the names of its contributors
     16   1.1       cgd  *    may be used to endorse or promote products derived from this software
     17   1.1       cgd  *    without specific prior written permission.
     18   1.1       cgd  *
     19   1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20   1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21   1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22   1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23   1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24   1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25   1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26   1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27   1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28   1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29   1.1       cgd  * SUCH DAMAGE.
     30   1.1       cgd  */
     31   1.1       cgd 
     32   1.4  christos #include <sys/cdefs.h>
     33   1.1       cgd #ifndef lint
     34   1.3       cgd #if 0
     35   1.3       cgd static char sccsid[] = "@(#)help.c	8.1 (Berkeley) 5/31/93";
     36   1.3       cgd #else
     37  1.13  dholland __RCSID("$NetBSD: help.c,v 1.13 2009/08/12 08:54:54 dholland Exp $");
     38   1.3       cgd #endif
     39   1.1       cgd #endif /* not lint */
     40   1.1       cgd 
     41   1.4  christos #include <stdio.h>
     42   1.4  christos #include <math.h>
     43   1.4  christos #include <unistd.h>
     44   1.9  christos #include <limits.h>
     45   1.4  christos #include "trek.h"
     46   1.1       cgd 
     47   1.1       cgd /*
     48   1.1       cgd **  call starbase for help
     49   1.1       cgd **
     50   1.1       cgd **	First, the closest starbase is selected.  If there is a
     51   1.1       cgd **	a starbase in your own quadrant, you are in good shape.
     52   1.1       cgd **	This distance takes quadrant distances into account only.
     53   1.1       cgd **
     54   1.1       cgd **	A magic number is computed based on the distance which acts
     55   1.1       cgd **	as the probability that you will be rematerialized.  You
     56   1.1       cgd **	get three tries.
     57   1.1       cgd **
     58   1.1       cgd **	When it is determined that you should be able to be remater-
     59   1.1       cgd **	ialized (i.e., when the probability thing mentioned above
     60   1.1       cgd **	comes up positive), you are put into that quadrant (anywhere).
     61   1.1       cgd **	Then, we try to see if there is a spot adjacent to the star-
     62   1.1       cgd **	base.  If not, you can't be rematerialized!!!  Otherwise,
     63   1.1       cgd **	it drops you there.  It only tries five times to find a spot
     64   1.1       cgd **	to drop you.  After that, it's your problem.
     65   1.1       cgd */
     66   1.1       cgd 
     67  1.13  dholland static const char *const Cntvect[3] = {
     68  1.11  dholland 	"first", "second", "third"
     69  1.11  dholland };
     70   1.1       cgd 
     71   1.4  christos /*ARGSUSED*/
     72   1.4  christos void
     73  1.10  dholland help(int v __unused)
     74   1.1       cgd {
     75   1.4  christos 	int		i;
     76   1.4  christos 	double		dist, x;
     77   1.4  christos 	int		dx = 0, dy = 0;
     78   1.4  christos 	int		j, l = 0;
     79   1.1       cgd 
     80   1.1       cgd 	/* check to see if calling for help is reasonable ... */
     81   1.4  christos 	if (Ship.cond == DOCKED) {
     82   1.4  christos 		printf("Uhura: But Captain, we're already docked\n");
     83   1.4  christos 		return;
     84   1.4  christos 	}
     85   1.1       cgd 
     86   1.1       cgd 	/* or possible */
     87   1.4  christos 	if (damaged(SSRADIO)) {
     88   1.4  christos 		out(SSRADIO);
     89   1.4  christos 		return;
     90   1.4  christos 	}
     91   1.4  christos 	if (Now.bases <= 0) {
     92   1.4  christos 		printf("Uhura: I'm not getting any response from starbase\n");
     93   1.4  christos 		return;
     94   1.4  christos 	}
     95   1.1       cgd 
     96   1.1       cgd 	/* tut tut, there goes the score */
     97   1.1       cgd 	Game.helps += 1;
     98   1.1       cgd 
     99   1.1       cgd 	/* find the closest base */
    100   1.9  christos 	dist = TOOLARGE;
    101  1.11  dholland 	if (Quad[Ship.quadx][Ship.quady].bases <= 0) {
    102   1.1       cgd 		/* there isn't one in this quadrant */
    103  1.11  dholland 		for (i = 0; i < Now.bases; i++) {
    104   1.1       cgd 			/* compute distance */
    105   1.1       cgd 			dx = Now.base[i].x - Ship.quadx;
    106   1.1       cgd 			dy = Now.base[i].y - Ship.quady;
    107   1.1       cgd 			x = dx * dx + dy * dy;
    108   1.1       cgd 			x = sqrt(x);
    109   1.1       cgd 
    110   1.1       cgd 			/* see if better than what we already have */
    111  1.11  dholland 			if (x < dist) {
    112   1.1       cgd 				dist = x;
    113   1.1       cgd 				l = i;
    114   1.1       cgd 			}
    115   1.1       cgd 		}
    116   1.1       cgd 
    117   1.1       cgd 		/* go to that quadrant */
    118   1.1       cgd 		Ship.quadx = Now.base[l].x;
    119   1.1       cgd 		Ship.quady = Now.base[l].y;
    120   1.1       cgd 		initquad(1);
    121  1.11  dholland 	} else {
    122   1.1       cgd 		dist = 0.0;
    123   1.1       cgd 	}
    124   1.1       cgd 
    125   1.1       cgd 	/* dematerialize the Enterprise */
    126   1.1       cgd 	Sect[Ship.sectx][Ship.secty] = EMPTY;
    127   1.1       cgd 	printf("Starbase in %d,%d responds\n", Ship.quadx, Ship.quady);
    128   1.1       cgd 
    129   1.1       cgd 	/* this next thing acts as a probability that it will work */
    130   1.1       cgd 	x = pow(1.0 - pow(0.94, dist), 0.3333333);
    131   1.1       cgd 
    132   1.1       cgd 	/* attempt to rematerialize */
    133  1.11  dholland 	for (i = 0; i < 3; i++) {
    134   1.1       cgd 		sleep(2);
    135   1.1       cgd 		printf("%s attempt to rematerialize ", Cntvect[i]);
    136  1.11  dholland 		if (franf() > x) {
    137   1.1       cgd 			/* ok, that's good.  let's see if we can set her down */
    138  1.11  dholland 			for (j = 0; j < 5; j++) {
    139   1.1       cgd 				dx = Etc.starbase.x + ranf(3) - 1;
    140   1.1       cgd 				if (dx < 0 || dx >= NSECTS)
    141   1.1       cgd 					continue;
    142   1.1       cgd 				dy = Etc.starbase.y + ranf(3) - 1;
    143  1.12  dholland 				if (dy < 0 || dy >= NSECTS ||
    144  1.12  dholland 				    Sect[dx][dy] != EMPTY)
    145   1.1       cgd 					continue;
    146   1.1       cgd 				break;
    147   1.1       cgd 			}
    148  1.11  dholland 			if (j < 5) {
    149   1.1       cgd 				/* found an empty spot */
    150   1.1       cgd 				printf("succeeds\n");
    151   1.1       cgd 				Ship.sectx = dx;
    152   1.1       cgd 				Ship.secty = dy;
    153   1.1       cgd 				Sect[dx][dy] = Ship.ship;
    154   1.4  christos 				dock(0);
    155   1.1       cgd 				compkldist(0);
    156   1.1       cgd 				return;
    157   1.1       cgd 			}
    158   1.1       cgd 			/* the starbase must have been surrounded */
    159   1.1       cgd 		}
    160   1.1       cgd 		printf("fails\n");
    161   1.1       cgd 	}
    162   1.1       cgd 
    163   1.1       cgd 	/* one, two, three strikes, you're out */
    164   1.1       cgd 	lose(L_NOHELP);
    165   1.1       cgd }
    166