trek/nova.c

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