Home | History | Annotate | Line # | Download | only in robots
make_level.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[] = "@(#)make_level.c	5.4 (Berkeley) 6/1/90";
     36  1.1  cgd #endif /* not lint */
     37  1.1  cgd 
     38  1.1  cgd # include	"robots.h"
     39  1.1  cgd 
     40  1.1  cgd /*
     41  1.1  cgd  * make_level:
     42  1.1  cgd  *	Make the current level
     43  1.1  cgd  */
     44  1.1  cgd make_level()
     45  1.1  cgd {
     46  1.1  cgd 	register int	i;
     47  1.1  cgd 	register COORD	*cp;
     48  1.1  cgd 	register WINDOW	*wp;
     49  1.1  cgd 	register int	x, *endp;
     50  1.1  cgd 
     51  1.1  cgd 	reset_count();
     52  1.1  cgd 	for (i = 1; i < Y_FIELDSIZE; i++)
     53  1.1  cgd 		for (x = 1; x < X_FIELDSIZE; x++)
     54  1.1  cgd 			if (Field[i][x] != 0)
     55  1.1  cgd 				mvaddch(i, x, ' ');
     56  1.1  cgd 	if (My_pos.y > 0)
     57  1.1  cgd 		mvaddch(My_pos.y, My_pos.x, ' ');
     58  1.1  cgd 
     59  1.1  cgd 	Waiting = FALSE;
     60  1.1  cgd 	Wait_bonus = 0;
     61  1.1  cgd 	leaveok(stdscr, FALSE);
     62  1.1  cgd 	for (cp = Robots; cp < &Robots[MAXROBOTS]; cp++)
     63  1.1  cgd 		cp->y = -1;
     64  1.1  cgd 	My_pos.y = -1;
     65  1.1  cgd 
     66  1.1  cgd 	bzero(Field, sizeof Field);
     67  1.1  cgd 	Min.y = Y_FIELDSIZE;
     68  1.1  cgd 	Min.x = X_FIELDSIZE;
     69  1.1  cgd 	Max.y = 0;
     70  1.1  cgd 	Max.x = 0;
     71  1.1  cgd 	if ((i = Level * 10) > MAXROBOTS)
     72  1.1  cgd 		i = MAXROBOTS;
     73  1.1  cgd 	Num_robots = i;
     74  1.1  cgd 	while (i-- > 0) {
     75  1.1  cgd 		cp = rnd_pos();
     76  1.1  cgd 		Robots[i] = *cp;
     77  1.1  cgd 		Field[cp->y][cp->x]++;
     78  1.1  cgd 		if (cp->y < Min.y)
     79  1.1  cgd 			Min.y = cp->y;
     80  1.1  cgd 		if (cp->x < Min.x)
     81  1.1  cgd 			Min.x = cp->x;
     82  1.1  cgd 		if (cp->y > Max.y)
     83  1.1  cgd 			Max.y = cp->y;
     84  1.1  cgd 		if (cp->x > Max.x)
     85  1.1  cgd 			Max.x = cp->x;
     86  1.1  cgd 	}
     87  1.1  cgd 	My_pos = *rnd_pos();
     88  1.1  cgd 	refresh();
     89  1.1  cgd }
     90