trek/nova.c

   1 /*
   2  * Copyright (c) 1980 Regents of the University of California.
   3  * All rights reserved.
   4  *
   5  * Redistribution and use in source and binary forms, with or without
   6  * modification, are permitted provided that the following conditions
   7  * are met:
   8  * 1. Redistributions of source code must retain the above copyright
   9  *    notice, this list of conditions and the following disclaimer.
  10  * 2. Redistributions in binary form must reproduce the above copyright
  11  *    notice, this list of conditions and the following disclaimer in the
  12  *    documentation and/or other materials provided with the distribution.
  13  * 3. All advertising materials mentioning features or use of this software
  14  *    must display the following acknowledgement:
  15  *      This product includes software developed by the University of
  16  *      California, Berkeley and its contributors.
  17  * 4. Neither the name of the University nor the names of its contributors
  18  *    may be used to endorse or promote products derived from this software
  19  *    without specific prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31  * SUCH DAMAGE.
  32  */
  33
  34 #ifndef lint
  35 /*static char sccsid[] = "from: @(#)nova.c      5.4 (Berkeley) 6/1/90";*/
  36 static char rcsid[] = "$Id: nova.c,v 1.2 1993/08/01 18:50:15 mycroft Exp $";
  37 #endif /* not lint */
  38
  39 # include       "trek.h"
  40
  41 /*
  42 **  CAUSE A NOVA TO OCCUR
  43 **
  44 **      A nova occurs.  It is the result of having a star hit with
  45 **      a photon torpedo.  There are several things which may happen.
  46 **      The star may not be affected.  It may go nova.  It may turn
  47 **      into a black hole.  Any (yummy) it may go supernova.
  48 **
  49 **      Stars that go nova cause stars which surround them to undergo
  50 **      the same probabilistic process.  Klingons next to them are
  51 **      destroyed.  And if the starship is next to it, it gets zapped.
  52 **      If the zap is too much, it gets destroyed.
  53 */
  54
  55 nova(x, y)
  56 int     x, y;
  57 {
  58         register int            i, j;
  59         register int            se;
  60
  61         if (Sect[x][y] != STAR || Quad[Ship.quadx][Ship.quady].stars < 0)
  62                 return;
  63         if (ranf(100) < 15)
  64         {
  65                 printf("Spock: Star at %d,%d failed to nova.\n", x, y);
  66                 return;
  67         }
  68         if (ranf(100) < 5)
  69                 return (snova(x, y));
  70         printf("Spock: Star at %d,%d gone nova\n", x, y);
  71
  72         if (ranf(4) != 0)
  73                 Sect[x][y] = EMPTY;
  74         else
  75         {
  76                 Sect[x][y] = HOLE;
  77                 Quad[Ship.quadx][Ship.quady].holes += 1;
  78         }
  79         Quad[Ship.quadx][Ship.quady].stars -= 1;
  80         Game.kills += 1;
  81         for (i = x - 1; i <= x + 1; i++)
  82         {
  83                 if (i < 0 || i >= NSECTS)
  84                         continue;
  85                 for (j = y - 1; j <= y + 1; j++)
  86                 {
  87                         if (j < 0 || j >= NSECTS)
  88                                 continue;
  89                         se = Sect[i][j];
  90                         switch (se)
  91                         {
  92
  93                           case EMPTY:
  94                           case HOLE:
  95                                 break;
  96
  97                           case KLINGON:
  98                                 killk(i, j);
  99                                 break;
 100
 101                           case STAR:
 102                                 nova(i, j);
 103                                 break;
 104
 105                           case INHABIT:
 106                                 kills(i, j, -1);
 107                                 break;
 108
 109                           case BASE:
 110                                 killb(i, j);
 111                                 Game.killb += 1;
 112                                 break;
 113
 114                           case ENTERPRISE:
 115                           case QUEENE:
 116                                 se = 2000;
 117                                 if (Ship.shldup)
 118                                         if (Ship.shield >= se)
 119                                         {
 120                                                 Ship.shield -= se;
 121                                                 se = 0;
 122                                         }
 123                                         else
 124                                         {
 125                                                 se -= Ship.shield;
 126                                                 Ship.shield = 0;
 127                                         }
 128                                 Ship.energy -= se;
 129                                 if (Ship.energy <= 0)
 130                                         lose(L_SUICID);
 131                                 break;
 132
 133                           default:
 134                                 printf("Unknown object %c at %d,%d destroyed\n",
 135                                         se, i, j);
 136                                 Sect[i][j] = EMPTY;
 137                                 break;
 138                         }
 139                 }
 140         }
 141         return;
 142 }