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