Home | History | Annotate | Line # | Download | only in robots
move_robs.c revision 1.1
      1  1.1  cgd /*
      2  1.1  cgd  * Copyright (c) 1980 Regents of the University of California.
      3  1.1  cgd  * All rights reserved.
      4  1.1  cgd  *
      5  1.1  cgd  * Redistribution and use in source and binary forms, with or without
      6  1.1  cgd  * modification, are permitted provided that the following conditions
      7  1.1  cgd  * are met:
      8  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
      9  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     10  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     11  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     12  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     13  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     14  1.1  cgd  *    must display the following acknowledgement:
     15  1.1  cgd  *	This product includes software developed by the University of
     16  1.1  cgd  *	California, Berkeley and its contributors.
     17  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     18  1.1  cgd  *    may be used to endorse or promote products derived from this software
     19  1.1  cgd  *    without specific prior written permission.
     20  1.1  cgd  *
     21  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  1.1  cgd  * SUCH DAMAGE.
     32  1.1  cgd  */
     33  1.1  cgd 
     34  1.1  cgd #ifndef lint
     35  1.1  cgd static char sccsid[] = "@(#)move_robs.c	5.5 (Berkeley) 2/28/91";
     36  1.1  cgd #endif /* not lint */
     37  1.1  cgd 
     38  1.1  cgd # include	"robots.h"
     39  1.1  cgd # include	<signal.h>
     40  1.1  cgd 
     41  1.1  cgd /*
     42  1.1  cgd  * move_robots:
     43  1.1  cgd  *	Move the robots around
     44  1.1  cgd  */
     45  1.1  cgd void
     46  1.1  cgd move_robots(was_sig)
     47  1.1  cgd bool	was_sig;
     48  1.1  cgd {
     49  1.1  cgd 	register COORD	*rp;
     50  1.1  cgd 	register int	y, x;
     51  1.1  cgd 	register int	mindist, d;
     52  1.1  cgd 	static COORD	newpos;
     53  1.1  cgd 
     54  1.1  cgd 	if (Real_time)
     55  1.1  cgd 		signal(SIGALRM, move_robots);
     56  1.1  cgd # ifdef DEBUG
     57  1.1  cgd 	move(Min.y, Min.x);
     58  1.1  cgd 	addch(inch());
     59  1.1  cgd 	move(Max.y, Max.x);
     60  1.1  cgd 	addch(inch());
     61  1.1  cgd # endif DEBUG
     62  1.1  cgd 	for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++) {
     63  1.1  cgd 		if (rp->y < 0)
     64  1.1  cgd 			continue;
     65  1.1  cgd 		mvaddch(rp->y, rp->x, ' ');
     66  1.1  cgd 		Field[rp->y][rp->x]--;
     67  1.1  cgd 		rp->y += sign(My_pos.y - rp->y);
     68  1.1  cgd 		rp->x += sign(My_pos.x - rp->x);
     69  1.1  cgd 		if (rp->y <= 0)
     70  1.1  cgd 			rp->y = 0;
     71  1.1  cgd 		else if (rp->y >= Y_FIELDSIZE)
     72  1.1  cgd 			rp->y = Y_FIELDSIZE - 1;
     73  1.1  cgd 		if (rp->x <= 0)
     74  1.1  cgd 			rp->x = 0;
     75  1.1  cgd 		else if (rp->x >= X_FIELDSIZE)
     76  1.1  cgd 			rp->x = X_FIELDSIZE - 1;
     77  1.1  cgd 		Field[rp->y][rp->x]++;
     78  1.1  cgd 	}
     79  1.1  cgd 
     80  1.1  cgd 	Min.y = Y_FIELDSIZE;
     81  1.1  cgd 	Min.x = X_FIELDSIZE;
     82  1.1  cgd 	Max.y = 0;
     83  1.1  cgd 	Max.x = 0;
     84  1.1  cgd 	for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++)
     85  1.1  cgd 		if (rp->y < 0)
     86  1.1  cgd 			continue;
     87  1.1  cgd 		else if (rp->y == My_pos.y && rp->x == My_pos.x)
     88  1.1  cgd 			Dead = TRUE;
     89  1.1  cgd 		else if (Field[rp->y][rp->x] > 1) {
     90  1.1  cgd 			mvaddch(rp->y, rp->x, HEAP);
     91  1.1  cgd 			rp->y = -1;
     92  1.1  cgd 			Num_robots--;
     93  1.1  cgd 			if (Waiting)
     94  1.1  cgd 				Wait_bonus++;
     95  1.1  cgd 			add_score(ROB_SCORE);
     96  1.1  cgd 		}
     97  1.1  cgd 		else {
     98  1.1  cgd 			mvaddch(rp->y, rp->x, ROBOT);
     99  1.1  cgd 			if (rp->y < Min.y)
    100  1.1  cgd 				Min.y = rp->y;
    101  1.1  cgd 			if (rp->x < Min.x)
    102  1.1  cgd 				Min.x = rp->x;
    103  1.1  cgd 			if (rp->y > Max.y)
    104  1.1  cgd 				Max.y = rp->y;
    105  1.1  cgd 			if (rp->x > Max.x)
    106  1.1  cgd 				Max.x = rp->x;
    107  1.1  cgd 		}
    108  1.1  cgd 
    109  1.1  cgd 	if (was_sig) {
    110  1.1  cgd 		refresh();
    111  1.1  cgd 		if (Dead || Num_robots <= 0)
    112  1.1  cgd 			longjmp(End_move, 0);
    113  1.1  cgd 	}
    114  1.1  cgd 
    115  1.1  cgd # ifdef DEBUG
    116  1.1  cgd 	standout();
    117  1.1  cgd 	move(Min.y, Min.x);
    118  1.1  cgd 	addch(inch());
    119  1.1  cgd 	move(Max.y, Max.x);
    120  1.1  cgd 	addch(inch());
    121  1.1  cgd 	standend();
    122  1.1  cgd # endif DEBUG
    123  1.1  cgd 	if (Real_time)
    124  1.1  cgd 		alarm(3);
    125  1.1  cgd }
    126  1.1  cgd 
    127  1.1  cgd /*
    128  1.1  cgd  * add_score:
    129  1.1  cgd  *	Add a score to the overall point total
    130  1.1  cgd  */
    131  1.1  cgd add_score(add)
    132  1.1  cgd int	add;
    133  1.1  cgd {
    134  1.1  cgd 	Score += add;
    135  1.1  cgd 	move(Y_SCORE, X_SCORE);
    136  1.1  cgd 	printw("%d", Score);
    137  1.1  cgd }
    138  1.1  cgd 
    139  1.1  cgd /*
    140  1.1  cgd  * sign:
    141  1.1  cgd  *	Return the sign of the number
    142  1.1  cgd  */
    143  1.1  cgd sign(n)
    144  1.1  cgd int	n;
    145  1.1  cgd {
    146  1.1  cgd 	if (n < 0)
    147  1.1  cgd 		return -1;
    148  1.1  cgd 	else if (n > 0)
    149  1.1  cgd 		return 1;
    150  1.1  cgd 	else
    151  1.1  cgd 		return 0;
    152  1.1  cgd }
    153