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