1 /* $OpenBSD: help.c,v 1.8 2016/01/07 14:37:51 mestre 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 #include <math.h> 34 #include <stdio.h> 35 #include <unistd.h> 36 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 const char *const Cntvect[3] = 60 {"first", "second", "third"}; 61 62 void 63 help(int v) 64 { 65 double dist, x; 66 int dx = 0, dy = 0; 67 int i, j, l = 0; 68 69 /* check to see if calling for help is reasonable ... */ 70 if (Ship.cond == DOCKED) 71 { 72 printf("Uhura: But Captain, we're already docked\n"); 73 return; 74 } 75 76 /* or possible */ 77 if (damaged(SSRADIO)) 78 { 79 out(SSRADIO); 80 return; 81 } 82 if (Now.bases <= 0) 83 { 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 = 1e50; 93 if (Quad[Ship.quadx][Ship.quady].bases <= 0) 94 { 95 /* there isn't one in this quadrant */ 96 for (i = 0; i < Now.bases; i++) 97 { 98 /* compute distance */ 99 dx = Now.base[i].x - Ship.quadx; 100 dy = Now.base[i].y - Ship.quady; 101 x = dx * dx + dy * dy; 102 x = sqrt(x); 103 104 /* see if better than what we already have */ 105 if (x < dist) 106 { 107 dist = x; 108 l = i; 109 } 110 } 111 112 /* go to that quadrant */ 113 Ship.quadx = Now.base[l].x; 114 Ship.quady = Now.base[l].y; 115 initquad(1); 116 } 117 else 118 { 119 dist = 0.0; 120 } 121 122 /* dematerialize the Enterprise */ 123 Sect[Ship.sectx][Ship.secty] = EMPTY; 124 printf("Starbase in %d,%d responds\n", Ship.quadx, Ship.quady); 125 126 /* this next thing acts as a probability that it will work */ 127 x = pow(1.0 - pow(0.94, dist), 0.3333333); 128 129 /* attempt to rematerialize */ 130 for (i = 0; i < 3; i++) 131 { 132 sleep(2); 133 printf("%s attempt to rematerialize ", Cntvect[i]); 134 if (franf() > x) 135 { 136 /* ok, that's good. let's see if we can set her down */ 137 for (j = 0; j < 5; j++) 138 { 139 dx = Etc.starbase.x + ranf(3) - 1; 140 if (dx < 0 || dx >= NSECTS) 141 continue; 142 dy = Etc.starbase.y + ranf(3) - 1; 143 if (dy < 0 || dy >= NSECTS || Sect[dx][dy] != EMPTY) 144 continue; 145 break; 146 } 147 if (j < 5) 148 { 149 /* found an empty spot */ 150 printf("succeeds\n"); 151 Ship.sectx = dx; 152 Ship.secty = dy; 153 Sect[dx][dy] = Ship.ship; 154 dock(0); 155 compkldist(0); 156 return; 157 } 158 /* the starbase must have been surrounded */ 159 } 160 printf("fails\n"); 161 } 162 163 /* one, two, three strikes, you're out */ 164 lose(L_NOHELP); 165 } 166