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