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