Home | History | Annotate | Line # | Download | only in robots
move_robs.c revision 1.6
      1  1.6       cgd /*	$NetBSD: move_robs.c,v 1.6 2001/01/16 02:50:28 cgd 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     lukem #include <sys/cdefs.h>
     37  1.1       cgd #ifndef lint
     38  1.3       cgd #if 0
     39  1.3       cgd static char sccsid[] = "@(#)move_robs.c	8.1 (Berkeley) 5/31/93";
     40  1.3       cgd #else
     41  1.6       cgd __RCSID("$NetBSD: move_robs.c,v 1.6 2001/01/16 02:50:28 cgd Exp $");
     42  1.3       cgd #endif
     43  1.1       cgd #endif /* not lint */
     44  1.1       cgd 
     45  1.1       cgd # include	"robots.h"
     46  1.1       cgd 
     47  1.1       cgd /*
     48  1.1       cgd  * move_robots:
     49  1.1       cgd  *	Move the robots around
     50  1.1       cgd  */
     51  1.1       cgd void
     52  1.1       cgd move_robots(was_sig)
     53  1.4     lukem 	int	was_sig;
     54  1.1       cgd {
     55  1.4     lukem 	COORD		*rp;
     56  1.1       cgd 
     57  1.1       cgd 	if (Real_time)
     58  1.1       cgd 		signal(SIGALRM, move_robots);
     59  1.1       cgd # ifdef DEBUG
     60  1.1       cgd 	move(Min.y, Min.x);
     61  1.1       cgd 	addch(inch());
     62  1.1       cgd 	move(Max.y, Max.x);
     63  1.1       cgd 	addch(inch());
     64  1.6       cgd # endif /* DEBUG */
     65  1.1       cgd 	for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++) {
     66  1.1       cgd 		if (rp->y < 0)
     67  1.1       cgd 			continue;
     68  1.1       cgd 		mvaddch(rp->y, rp->x, ' ');
     69  1.1       cgd 		Field[rp->y][rp->x]--;
     70  1.1       cgd 		rp->y += sign(My_pos.y - rp->y);
     71  1.1       cgd 		rp->x += sign(My_pos.x - rp->x);
     72  1.1       cgd 		if (rp->y <= 0)
     73  1.1       cgd 			rp->y = 0;
     74  1.1       cgd 		else if (rp->y >= Y_FIELDSIZE)
     75  1.1       cgd 			rp->y = Y_FIELDSIZE - 1;
     76  1.1       cgd 		if (rp->x <= 0)
     77  1.1       cgd 			rp->x = 0;
     78  1.1       cgd 		else if (rp->x >= X_FIELDSIZE)
     79  1.1       cgd 			rp->x = X_FIELDSIZE - 1;
     80  1.1       cgd 		Field[rp->y][rp->x]++;
     81  1.1       cgd 	}
     82  1.1       cgd 
     83  1.1       cgd 	Min.y = Y_FIELDSIZE;
     84  1.1       cgd 	Min.x = X_FIELDSIZE;
     85  1.1       cgd 	Max.y = 0;
     86  1.1       cgd 	Max.x = 0;
     87  1.1       cgd 	for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++)
     88  1.1       cgd 		if (rp->y < 0)
     89  1.1       cgd 			continue;
     90  1.1       cgd 		else if (rp->y == My_pos.y && rp->x == My_pos.x)
     91  1.1       cgd 			Dead = TRUE;
     92  1.1       cgd 		else if (Field[rp->y][rp->x] > 1) {
     93  1.1       cgd 			mvaddch(rp->y, rp->x, HEAP);
     94  1.5  christos 			Scrap[Num_scrap++] = *rp;
     95  1.1       cgd 			rp->y = -1;
     96  1.1       cgd 			Num_robots--;
     97  1.1       cgd 			if (Waiting)
     98  1.1       cgd 				Wait_bonus++;
     99  1.1       cgd 			add_score(ROB_SCORE);
    100  1.1       cgd 		}
    101  1.1       cgd 		else {
    102  1.1       cgd 			mvaddch(rp->y, rp->x, ROBOT);
    103  1.1       cgd 			if (rp->y < Min.y)
    104  1.1       cgd 				Min.y = rp->y;
    105  1.1       cgd 			if (rp->x < Min.x)
    106  1.1       cgd 				Min.x = rp->x;
    107  1.1       cgd 			if (rp->y > Max.y)
    108  1.1       cgd 				Max.y = rp->y;
    109  1.1       cgd 			if (rp->x > Max.x)
    110  1.1       cgd 				Max.x = rp->x;
    111  1.1       cgd 		}
    112  1.1       cgd 
    113  1.1       cgd 	if (was_sig) {
    114  1.1       cgd 		refresh();
    115  1.1       cgd 		if (Dead || Num_robots <= 0)
    116  1.1       cgd 			longjmp(End_move, 0);
    117  1.1       cgd 	}
    118  1.1       cgd 
    119  1.1       cgd # ifdef DEBUG
    120  1.1       cgd 	standout();
    121  1.1       cgd 	move(Min.y, Min.x);
    122  1.1       cgd 	addch(inch());
    123  1.1       cgd 	move(Max.y, Max.x);
    124  1.1       cgd 	addch(inch());
    125  1.1       cgd 	standend();
    126  1.5  christos # endif /* DEBUG */
    127  1.1       cgd 	if (Real_time)
    128  1.1       cgd 		alarm(3);
    129  1.1       cgd }
    130  1.1       cgd 
    131  1.1       cgd /*
    132  1.1       cgd  * add_score:
    133  1.1       cgd  *	Add a score to the overall point total
    134  1.1       cgd  */
    135  1.4     lukem void
    136  1.1       cgd add_score(add)
    137  1.4     lukem 	int	add;
    138  1.1       cgd {
    139  1.1       cgd 	Score += add;
    140  1.1       cgd 	move(Y_SCORE, X_SCORE);
    141  1.1       cgd 	printw("%d", Score);
    142  1.1       cgd }
    143  1.1       cgd 
    144  1.1       cgd /*
    145  1.1       cgd  * sign:
    146  1.1       cgd  *	Return the sign of the number
    147  1.1       cgd  */
    148  1.4     lukem int
    149  1.1       cgd sign(n)
    150  1.4     lukem 	int	n;
    151  1.1       cgd {
    152  1.1       cgd 	if (n < 0)
    153  1.1       cgd 		return -1;
    154  1.1       cgd 	else if (n > 0)
    155  1.1       cgd 		return 1;
    156  1.1       cgd 	else
    157  1.1       cgd 		return 0;
    158  1.1       cgd }
    159