1 /* $OpenBSD: help.c,v 1.5 2003/06/03 03:01:41 millert Exp $ */ 2 /* $NetBSD: help.c,v 1.3 1995/04/22 10:59:01 cgd 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 #ifndef lint 34 #if 0 35 static char sccsid[] = "@(#)help.c 8.1 (Berkeley) 5/31/93"; 36 #else 37 static char rcsid[] = "$OpenBSD: help.c,v 1.5 2003/06/03 03:01:41 millert Exp $"; 38 #endif 39 #endif /* not lint */ 40 41 #include <stdio.h> 42 #include <math.h> 43 #include <unistd.h> 44 #include "trek.h" 45 46 /* 47 ** call starbase for help 48 ** 49 ** First, the closest starbase is selected. If there is a 50 ** a starbase in your own quadrant, you are in good shape. 51 ** This distance takes quadrant distances into account only. 52 ** 53 ** A magic number is computed based on the distance which acts 54 ** as the probability that you will be rematerialized. You 55 ** get three tries. 56 ** 57 ** When it is determined that you should be able to be remater- 58 ** ialized (i.e., when the probability thing mentioned above 59 ** comes up positive), you are put into that quadrant (anywhere). 60 ** Then, we try to see if there is a spot adjacent to the star- 61 ** base. If not, you can't be rematerialized!!! Otherwise, 62 ** it drops you there. It only tries five times to find a spot 63 ** to drop you. After that, it's your problem. 64 */ 65 66 const char *const Cntvect[3] = 67 {"first", "second", "third"}; 68 69 void 70 help(v) 71 int v; 72 { 73 double dist, x; 74 int dx = 0, dy = 0; 75 int i, j, l = 0; 76 77 /* check to see if calling for help is reasonable ... */ 78 if (Ship.cond == DOCKED) 79 { 80 printf("Uhura: But Captain, we're already docked\n"); 81 return; 82 } 83 84 /* or possible */ 85 if (damaged(SSRADIO)) 86 { 87 out(SSRADIO); 88 return; 89 } 90 if (Now.bases <= 0) 91 { 92 printf("Uhura: I'm not getting any response from starbase\n"); 93 return; 94 } 95 96 /* tut tut, there goes the score */ 97 Game.helps += 1; 98 99 /* find the closest base */ 100 dist = 1e50; 101 if (Quad[Ship.quadx][Ship.quady].bases <= 0) 102 { 103 /* there isn't one in this quadrant */ 104 for (i = 0; i < Now.bases; i++) 105 { 106 /* compute distance */ 107 dx = Now.base[i].x - Ship.quadx; 108 dy = Now.base[i].y - Ship.quady; 109 x = dx * dx + dy * dy; 110 x = sqrt(x); 111 112 /* see if better than what we already have */ 113 if (x < dist) 114 { 115 dist = x; 116 l = i; 117 } 118 } 119 120 /* go to that quadrant */ 121 Ship.quadx = Now.base[l].x; 122 Ship.quady = Now.base[l].y; 123 initquad(1); 124 } 125 else 126 { 127 dist = 0.0; 128 } 129 130 /* dematerialize the Enterprise */ 131 Sect[Ship.sectx][Ship.secty] = EMPTY; 132 printf("Starbase in %d,%d responds\n", Ship.quadx, Ship.quady); 133 134 /* this next thing acts as a probability that it will work */ 135 x = pow(1.0 - pow(0.94, dist), 0.3333333); 136 137 /* attempt to rematerialize */ 138 for (i = 0; i < 3; i++) 139 { 140 sleep(2); 141 printf("%s attempt to rematerialize ", Cntvect[i]); 142 if (franf() > x) 143 { 144 /* ok, that's good. let's see if we can set her down */ 145 for (j = 0; j < 5; j++) 146 { 147 dx = Etc.starbase.x + ranf(3) - 1; 148 if (dx < 0 || dx >= NSECTS) 149 continue; 150 dy = Etc.starbase.y + ranf(3) - 1; 151 if (dy < 0 || dy >= NSECTS || Sect[dx][dy] != EMPTY) 152 continue; 153 break; 154 } 155 if (j < 5) 156 { 157 /* found an empty spot */ 158 printf("succeeds\n"); 159 Ship.sectx = dx; 160 Ship.secty = dy; 161 Sect[dx][dy] = Ship.ship; 162 dock(0); 163 compkldist(0); 164 return; 165 } 166 /* the starbase must have been surrounded */ 167 } 168 printf("fails\n"); 169 } 170 171 /* one, two, three strikes, you're out */ 172 lose(L_NOHELP); 173 } 174