move.c revision 1.6 1 1.6 lukem /* $NetBSD: move.c,v 1.6 1997/10/12 14:09:59 lukem Exp $ */
2 1.4 cgd
3 1.1 cgd /*
4 1.4 cgd * Copyright (c) 1980, 1993
5 1.4 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.6 lukem #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.4 cgd #if 0
39 1.4 cgd static char sccsid[] = "@(#)move.c 8.1 (Berkeley) 5/31/93";
40 1.4 cgd #else
41 1.6 lukem __RCSID("$NetBSD: move.c,v 1.6 1997/10/12 14:09:59 lukem Exp $");
42 1.4 cgd #endif
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.4 cgd #include "robots.h"
46 1.1 cgd
47 1.1 cgd # define ESC '\033'
48 1.1 cgd
49 1.1 cgd /*
50 1.1 cgd * get_move:
51 1.1 cgd * Get and execute a move from the player
52 1.1 cgd */
53 1.6 lukem void
54 1.1 cgd get_move()
55 1.1 cgd {
56 1.6 lukem int c;
57 1.1 cgd
58 1.1 cgd if (Waiting)
59 1.1 cgd return;
60 1.1 cgd
61 1.1 cgd #ifdef FANCY
62 1.1 cgd if (Pattern_roll) {
63 1.1 cgd if (Next_move >= Move_list)
64 1.1 cgd lastmove = *Next_move;
65 1.1 cgd else
66 1.1 cgd lastmove = -1; /* flag for "first time in" */
67 1.1 cgd }
68 1.1 cgd #endif
69 1.1 cgd for (;;) {
70 1.1 cgd if (Teleport && must_telep())
71 1.1 cgd goto teleport;
72 1.1 cgd if (Running)
73 1.1 cgd c = Run_ch;
74 1.1 cgd else if (Count != 0)
75 1.1 cgd c = Cnt_move;
76 1.1 cgd #ifdef FANCY
77 1.1 cgd else if (Num_robots > 1 && Stand_still)
78 1.1 cgd c = '>';
79 1.1 cgd else if (Num_robots > 1 && Pattern_roll) {
80 1.1 cgd if (*++Next_move == '\0') {
81 1.1 cgd if (lastmove < 0)
82 1.1 cgd goto over;
83 1.1 cgd Next_move = Move_list;
84 1.1 cgd }
85 1.1 cgd c = *Next_move;
86 1.1 cgd mvaddch(0, 0, c);
87 1.1 cgd if (c == lastmove)
88 1.1 cgd goto over;
89 1.1 cgd }
90 1.1 cgd #endif
91 1.1 cgd else {
92 1.1 cgd over:
93 1.1 cgd c = getchar();
94 1.1 cgd if (isdigit(c)) {
95 1.1 cgd Count = (c - '0');
96 1.1 cgd while (isdigit(c = getchar()))
97 1.1 cgd Count = Count * 10 + (c - '0');
98 1.1 cgd if (c == ESC)
99 1.1 cgd goto over;
100 1.1 cgd Cnt_move = c;
101 1.1 cgd if (Count)
102 1.1 cgd leaveok(stdscr, TRUE);
103 1.1 cgd }
104 1.1 cgd }
105 1.1 cgd
106 1.1 cgd switch (c) {
107 1.1 cgd case ' ':
108 1.1 cgd case '.':
109 1.1 cgd if (do_move(0, 0))
110 1.1 cgd goto ret;
111 1.1 cgd break;
112 1.1 cgd case 'y':
113 1.1 cgd if (do_move(-1, -1))
114 1.1 cgd goto ret;
115 1.1 cgd break;
116 1.1 cgd case 'k':
117 1.1 cgd if (do_move(-1, 0))
118 1.1 cgd goto ret;
119 1.1 cgd break;
120 1.1 cgd case 'u':
121 1.1 cgd if (do_move(-1, 1))
122 1.1 cgd goto ret;
123 1.1 cgd break;
124 1.1 cgd case 'h':
125 1.1 cgd if (do_move(0, -1))
126 1.1 cgd goto ret;
127 1.1 cgd break;
128 1.1 cgd case 'l':
129 1.1 cgd if (do_move(0, 1))
130 1.1 cgd goto ret;
131 1.1 cgd break;
132 1.1 cgd case 'b':
133 1.1 cgd if (do_move(1, -1))
134 1.1 cgd goto ret;
135 1.1 cgd break;
136 1.1 cgd case 'j':
137 1.1 cgd if (do_move(1, 0))
138 1.1 cgd goto ret;
139 1.1 cgd break;
140 1.1 cgd case 'n':
141 1.1 cgd if (do_move(1, 1))
142 1.1 cgd goto ret;
143 1.1 cgd break;
144 1.1 cgd case 'Y': case 'U': case 'H': case 'J':
145 1.1 cgd case 'K': case 'L': case 'B': case 'N':
146 1.1 cgd case '>':
147 1.1 cgd Running = TRUE;
148 1.1 cgd if (c == '>')
149 1.1 cgd Run_ch = ' ';
150 1.1 cgd else
151 1.1 cgd Run_ch = tolower(c);
152 1.1 cgd leaveok(stdscr, TRUE);
153 1.1 cgd break;
154 1.1 cgd case 'q':
155 1.1 cgd case 'Q':
156 1.1 cgd if (query("Really quit?"))
157 1.6 lukem quit(0);
158 1.1 cgd refresh();
159 1.1 cgd break;
160 1.1 cgd case 'w':
161 1.1 cgd case 'W':
162 1.1 cgd Waiting = TRUE;
163 1.1 cgd leaveok(stdscr, TRUE);
164 1.1 cgd goto ret;
165 1.1 cgd case 't':
166 1.1 cgd case 'T':
167 1.1 cgd teleport:
168 1.1 cgd Running = FALSE;
169 1.1 cgd mvaddch(My_pos.y, My_pos.x, ' ');
170 1.1 cgd My_pos = *rnd_pos();
171 1.1 cgd mvaddch(My_pos.y, My_pos.x, PLAYER);
172 1.1 cgd leaveok(stdscr, FALSE);
173 1.1 cgd refresh();
174 1.1 cgd flush_in();
175 1.1 cgd goto ret;
176 1.2 mycroft case CTRL('L'):
177 1.1 cgd wrefresh(curscr);
178 1.1 cgd break;
179 1.1 cgd case EOF:
180 1.1 cgd break;
181 1.1 cgd default:
182 1.2 mycroft putchar(CTRL('G'));
183 1.1 cgd reset_count();
184 1.1 cgd fflush(stdout);
185 1.1 cgd break;
186 1.1 cgd }
187 1.1 cgd }
188 1.1 cgd ret:
189 1.1 cgd if (Count > 0)
190 1.1 cgd if (--Count == 0)
191 1.1 cgd leaveok(stdscr, FALSE);
192 1.1 cgd }
193 1.1 cgd
194 1.1 cgd /*
195 1.1 cgd * must_telep:
196 1.1 cgd * Must I teleport; i.e., is there anywhere I can move without
197 1.1 cgd * being eaten?
198 1.1 cgd */
199 1.6 lukem bool
200 1.1 cgd must_telep()
201 1.1 cgd {
202 1.6 lukem int x, y;
203 1.1 cgd static COORD newpos;
204 1.1 cgd
205 1.1 cgd #ifdef FANCY
206 1.1 cgd if (Stand_still && Num_robots > 1 && eaten(&My_pos))
207 1.1 cgd return TRUE;
208 1.1 cgd #endif
209 1.1 cgd
210 1.1 cgd for (y = -1; y <= 1; y++) {
211 1.1 cgd newpos.y = My_pos.y + y;
212 1.1 cgd if (newpos.y <= 0 || newpos.y >= Y_FIELDSIZE)
213 1.1 cgd continue;
214 1.1 cgd for (x = -1; x <= 1; x++) {
215 1.1 cgd newpos.x = My_pos.x + x;
216 1.1 cgd if (newpos.x <= 0 || newpos.x >= X_FIELDSIZE)
217 1.1 cgd continue;
218 1.1 cgd if (Field[newpos.y][newpos.x] > 0)
219 1.1 cgd continue;
220 1.1 cgd if (!eaten(&newpos))
221 1.1 cgd return FALSE;
222 1.1 cgd }
223 1.1 cgd }
224 1.1 cgd return TRUE;
225 1.1 cgd }
226 1.1 cgd
227 1.1 cgd /*
228 1.1 cgd * do_move:
229 1.1 cgd * Execute a move
230 1.1 cgd */
231 1.6 lukem bool
232 1.1 cgd do_move(dy, dx)
233 1.6 lukem int dy, dx;
234 1.1 cgd {
235 1.1 cgd static COORD newpos;
236 1.1 cgd
237 1.1 cgd newpos.y = My_pos.y + dy;
238 1.1 cgd newpos.x = My_pos.x + dx;
239 1.1 cgd if (newpos.y <= 0 || newpos.y >= Y_FIELDSIZE ||
240 1.1 cgd newpos.x <= 0 || newpos.x >= X_FIELDSIZE ||
241 1.1 cgd Field[newpos.y][newpos.x] > 0 || eaten(&newpos)) {
242 1.1 cgd if (Running) {
243 1.1 cgd Running = FALSE;
244 1.1 cgd leaveok(stdscr, FALSE);
245 1.1 cgd move(My_pos.y, My_pos.x);
246 1.1 cgd refresh();
247 1.1 cgd }
248 1.1 cgd else {
249 1.2 mycroft putchar(CTRL('G'));
250 1.1 cgd reset_count();
251 1.1 cgd }
252 1.1 cgd return FALSE;
253 1.1 cgd }
254 1.1 cgd else if (dy == 0 && dx == 0)
255 1.1 cgd return TRUE;
256 1.1 cgd mvaddch(My_pos.y, My_pos.x, ' ');
257 1.1 cgd My_pos = newpos;
258 1.1 cgd mvaddch(My_pos.y, My_pos.x, PLAYER);
259 1.1 cgd if (!jumping())
260 1.1 cgd refresh();
261 1.1 cgd return TRUE;
262 1.1 cgd }
263 1.1 cgd
264 1.1 cgd /*
265 1.1 cgd * eaten:
266 1.1 cgd * Player would get eaten at this place
267 1.1 cgd */
268 1.6 lukem bool
269 1.1 cgd eaten(pos)
270 1.6 lukem COORD *pos;
271 1.1 cgd {
272 1.6 lukem int x, y;
273 1.1 cgd
274 1.1 cgd for (y = pos->y - 1; y <= pos->y + 1; y++) {
275 1.1 cgd if (y <= 0 || y >= Y_FIELDSIZE)
276 1.1 cgd continue;
277 1.1 cgd for (x = pos->x - 1; x <= pos->x + 1; x++) {
278 1.1 cgd if (x <= 0 || x >= X_FIELDSIZE)
279 1.1 cgd continue;
280 1.1 cgd if (Field[y][x] == 1)
281 1.1 cgd return TRUE;
282 1.1 cgd }
283 1.1 cgd }
284 1.1 cgd return FALSE;
285 1.1 cgd }
286 1.1 cgd
287 1.1 cgd /*
288 1.1 cgd * reset_count:
289 1.1 cgd * Reset the count variables
290 1.1 cgd */
291 1.6 lukem void
292 1.1 cgd reset_count()
293 1.1 cgd {
294 1.1 cgd Count = 0;
295 1.1 cgd Running = FALSE;
296 1.1 cgd leaveok(stdscr, FALSE);
297 1.1 cgd refresh();
298 1.1 cgd }
299 1.1 cgd
300 1.1 cgd /*
301 1.1 cgd * jumping:
302 1.1 cgd * See if we are jumping, i.e., we should not refresh.
303 1.1 cgd */
304 1.6 lukem bool
305 1.1 cgd jumping()
306 1.1 cgd {
307 1.1 cgd return (Jump && (Count || Running || Waiting));
308 1.1 cgd }
309