Home | History | Annotate | Line # | Download | only in trek
nova.c revision 1.1 
      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[] = "@(#)nova.c	5.4 (Berkeley) 6/1/90";
     36 #endif /* not lint */
     37 
     38 # include	"trek.h"
     39 
     40 /*
     41 **  CAUSE A NOVA TO OCCUR
     42 **
     43 **	A nova occurs.  It is the result of having a star hit with
     44 **	a photon torpedo.  There are several things which may happen.
     45 **	The star may not be affected.  It may go nova.  It may turn
     46 **	into a black hole.  Any (yummy) it may go supernova.
     47 **
     48 **	Stars that go nova cause stars which surround them to undergo
     49 **	the same probabilistic process.  Klingons next to them are
     50 **	destroyed.  And if the starship is next to it, it gets zapped.
     51 **	If the zap is too much, it gets destroyed.
     52 */
     53 
     54 nova(x, y)
     55 int	x, y;
     56 {
     57 	register int		i, j;
     58 	register int		se;
     59 
     60 	if (Sect[x][y] != STAR || Quad[Ship.quadx][Ship.quady].stars < 0)
     61 		return;
     62 	if (ranf(100) < 15)
     63 	{
     64 		printf("Spock: Star at %d,%d failed to nova.\n", x, y);
     65 		return;
     66 	}
     67 	if (ranf(100) < 5)
     68 		return (snova(x, y));
     69 	printf("Spock: Star at %d,%d gone nova\n", x, y);
     70 
     71 	if (ranf(4) != 0)
     72 		Sect[x][y] = EMPTY;
     73 	else
     74 	{
     75 		Sect[x][y] = HOLE;
     76 		Quad[Ship.quadx][Ship.quady].holes += 1;
     77 	}
     78 	Quad[Ship.quadx][Ship.quady].stars -= 1;
     79 	Game.kills += 1;
     80 	for (i = x - 1; i <= x + 1; i++)
     81 	{
     82 		if (i < 0 || i >= NSECTS)
     83 			continue;
     84 		for (j = y - 1; j <= y + 1; j++)
     85 		{
     86 			if (j < 0 || j >= NSECTS)
     87 				continue;
     88 			se = Sect[i][j];
     89 			switch (se)
     90 			{
     91 
     92 			  case EMPTY:
     93 			  case HOLE:
     94 				break;
     95 
     96 			  case KLINGON:
     97 				killk(i, j);
     98 				break;
     99 
    100 			  case STAR:
    101 				nova(i, j);
    102 				break;
    103 
    104 			  case INHABIT:
    105 				kills(i, j, -1);
    106 				break;
    107 
    108 			  case BASE:
    109 				killb(i, j);
    110 				Game.killb += 1;
    111 				break;
    112 
    113 			  case ENTERPRISE:
    114 			  case QUEENE:
    115 				se = 2000;
    116 				if (Ship.shldup)
    117 					if (Ship.shield >= se)
    118 					{
    119 						Ship.shield -= se;
    120 						se = 0;
    121 					}
    122 					else
    123 					{
    124 						se -= Ship.shield;
    125 						Ship.shield = 0;
    126 					}
    127 				Ship.energy -= se;
    128 				if (Ship.energy <= 0)
    129 					lose(L_SUICID);
    130 				break;
    131 
    132 			  default:
    133 				printf("Unknown object %c at %d,%d destroyed\n",
    134 					se, i, j);
    135 				Sect[i][j] = EMPTY;
    136 				break;
    137 			}
    138 		}
    139 	}
    140 	return;
    141 }
    142