xref: /openbsd/games/robots/make_level.c (revision 78b63d65)
1 /*	$OpenBSD: make_level.c,v 1.3 1998/08/22 08:55:55 pjanzen Exp $	*/
2 /*	$NetBSD: make_level.c,v 1.3 1995/04/22 10:08:56 cgd Exp $	*/
3 
4 /*
5  * Copyright (c) 1980, 1993
6  *	The Regents of the University of California.  All rights reserved.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions
10  * are met:
11  * 1. Redistributions of source code must retain the above copyright
12  *    notice, this list of conditions and the following disclaimer.
13  * 2. Redistributions in binary form must reproduce the above copyright
14  *    notice, this list of conditions and the following disclaimer in the
15  *    documentation and/or other materials provided with the distribution.
16  * 3. All advertising materials mentioning features or use of this software
17  *    must display the following acknowledgement:
18  *	This product includes software developed by the University of
19  *	California, Berkeley and its contributors.
20  * 4. Neither the name of the University nor the names of its contributors
21  *    may be used to endorse or promote products derived from this software
22  *    without specific prior written permission.
23  *
24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34  * SUCH DAMAGE.
35  */
36 
37 #ifndef lint
38 #if 0
39 static char sccsid[] = "@(#)make_level.c	8.1 (Berkeley) 5/31/93";
40 #else
41 static char rcsid[] = "$OpenBSD: make_level.c,v 1.3 1998/08/22 08:55:55 pjanzen Exp $";
42 #endif
43 #endif /* not lint */
44 
45 #include	"robots.h"
46 
47 /*
48  * make_level:
49  *	Make the current level
50  */
51 void
52 make_level()
53 {
54 	register int	i;
55 	register COORD	*cp;
56 	register int	x;
57 
58 	reset_count();
59 	for (i = 1; i < Y_FIELDSIZE; i++)
60 		for (x = 1; x < X_FIELDSIZE; x++)
61 			if (Field[i][x] != 0)
62 				mvaddch(i, x, ' ');
63 	if (My_pos.y > 0)
64 		mvaddch(My_pos.y, My_pos.x, ' ');
65 
66 	Waiting = FALSE;
67 	Wait_bonus = 0;
68 	leaveok(stdscr, FALSE);
69 	for (cp = Robots; cp < &Robots[MAXROBOTS]; cp++)
70 		cp->y = -1;
71 	My_pos.y = -1;
72 
73 	memset(Field, 0, sizeof Field);
74 	Min.y = Y_FIELDSIZE;
75 	Min.x = X_FIELDSIZE;
76 	Max.y = 0;
77 	Max.x = 0;
78 	if ((i = Level * 10) > MAXROBOTS)
79 		i = MAXROBOTS;
80 	Num_robots = i;
81 	while (i-- > 0) {
82 		cp = rnd_pos();
83 		Robots[i] = *cp;
84 		Field[cp->y][cp->x]++;
85 		if (cp->y < Min.y)
86 			Min.y = cp->y;
87 		if (cp->x < Min.x)
88 			Min.x = cp->x;
89 		if (cp->y > Max.y)
90 			Max.y = cp->y;
91 		if (cp->x > Max.x)
92 			Max.x = cp->x;
93 	}
94 	My_pos = *rnd_pos();
95 	refresh();
96 }
97