move.c revision 1.2 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[] = "@(#)move.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 # include <ctype.h>
40 1.1 cgd
41 1.1 cgd # define ESC '\033'
42 1.1 cgd
43 1.1 cgd /*
44 1.1 cgd * get_move:
45 1.1 cgd * Get and execute a move from the player
46 1.1 cgd */
47 1.1 cgd get_move()
48 1.1 cgd {
49 1.1 cgd register int c;
50 1.1 cgd register int y, x, lastmove;
51 1.1 cgd static COORD newpos;
52 1.1 cgd
53 1.1 cgd if (Waiting)
54 1.1 cgd return;
55 1.1 cgd
56 1.1 cgd #ifdef FANCY
57 1.1 cgd if (Pattern_roll) {
58 1.1 cgd if (Next_move >= Move_list)
59 1.1 cgd lastmove = *Next_move;
60 1.1 cgd else
61 1.1 cgd lastmove = -1; /* flag for "first time in" */
62 1.1 cgd }
63 1.1 cgd #endif
64 1.1 cgd for (;;) {
65 1.1 cgd if (Teleport && must_telep())
66 1.1 cgd goto teleport;
67 1.1 cgd if (Running)
68 1.1 cgd c = Run_ch;
69 1.1 cgd else if (Count != 0)
70 1.1 cgd c = Cnt_move;
71 1.1 cgd #ifdef FANCY
72 1.1 cgd else if (Num_robots > 1 && Stand_still)
73 1.1 cgd c = '>';
74 1.1 cgd else if (Num_robots > 1 && Pattern_roll) {
75 1.1 cgd if (*++Next_move == '\0') {
76 1.1 cgd if (lastmove < 0)
77 1.1 cgd goto over;
78 1.1 cgd Next_move = Move_list;
79 1.1 cgd }
80 1.1 cgd c = *Next_move;
81 1.1 cgd mvaddch(0, 0, c);
82 1.1 cgd if (c == lastmove)
83 1.1 cgd goto over;
84 1.1 cgd }
85 1.1 cgd #endif
86 1.1 cgd else {
87 1.1 cgd over:
88 1.1 cgd c = getchar();
89 1.1 cgd if (isdigit(c)) {
90 1.1 cgd Count = (c - '0');
91 1.1 cgd while (isdigit(c = getchar()))
92 1.1 cgd Count = Count * 10 + (c - '0');
93 1.1 cgd if (c == ESC)
94 1.1 cgd goto over;
95 1.1 cgd Cnt_move = c;
96 1.1 cgd if (Count)
97 1.1 cgd leaveok(stdscr, TRUE);
98 1.1 cgd }
99 1.1 cgd }
100 1.1 cgd
101 1.1 cgd switch (c) {
102 1.1 cgd case ' ':
103 1.1 cgd case '.':
104 1.1 cgd if (do_move(0, 0))
105 1.1 cgd goto ret;
106 1.1 cgd break;
107 1.1 cgd case 'y':
108 1.1 cgd if (do_move(-1, -1))
109 1.1 cgd goto ret;
110 1.1 cgd break;
111 1.1 cgd case 'k':
112 1.1 cgd if (do_move(-1, 0))
113 1.1 cgd goto ret;
114 1.1 cgd break;
115 1.1 cgd case 'u':
116 1.1 cgd if (do_move(-1, 1))
117 1.1 cgd goto ret;
118 1.1 cgd break;
119 1.1 cgd case 'h':
120 1.1 cgd if (do_move(0, -1))
121 1.1 cgd goto ret;
122 1.1 cgd break;
123 1.1 cgd case 'l':
124 1.1 cgd if (do_move(0, 1))
125 1.1 cgd goto ret;
126 1.1 cgd break;
127 1.1 cgd case 'b':
128 1.1 cgd if (do_move(1, -1))
129 1.1 cgd goto ret;
130 1.1 cgd break;
131 1.1 cgd case 'j':
132 1.1 cgd if (do_move(1, 0))
133 1.1 cgd goto ret;
134 1.1 cgd break;
135 1.1 cgd case 'n':
136 1.1 cgd if (do_move(1, 1))
137 1.1 cgd goto ret;
138 1.1 cgd break;
139 1.1 cgd case 'Y': case 'U': case 'H': case 'J':
140 1.1 cgd case 'K': case 'L': case 'B': case 'N':
141 1.1 cgd case '>':
142 1.1 cgd Running = TRUE;
143 1.1 cgd if (c == '>')
144 1.1 cgd Run_ch = ' ';
145 1.1 cgd else
146 1.1 cgd Run_ch = tolower(c);
147 1.1 cgd leaveok(stdscr, TRUE);
148 1.1 cgd break;
149 1.1 cgd case 'q':
150 1.1 cgd case 'Q':
151 1.1 cgd if (query("Really quit?"))
152 1.1 cgd quit();
153 1.1 cgd refresh();
154 1.1 cgd break;
155 1.1 cgd case 'w':
156 1.1 cgd case 'W':
157 1.1 cgd Waiting = TRUE;
158 1.1 cgd leaveok(stdscr, TRUE);
159 1.1 cgd flushok(stdscr, FALSE);
160 1.1 cgd goto ret;
161 1.1 cgd case 't':
162 1.1 cgd case 'T':
163 1.1 cgd teleport:
164 1.1 cgd Running = FALSE;
165 1.1 cgd mvaddch(My_pos.y, My_pos.x, ' ');
166 1.1 cgd My_pos = *rnd_pos();
167 1.1 cgd mvaddch(My_pos.y, My_pos.x, PLAYER);
168 1.1 cgd leaveok(stdscr, FALSE);
169 1.1 cgd refresh();
170 1.1 cgd flush_in();
171 1.1 cgd goto ret;
172 1.2 mycroft case CTRL('L'):
173 1.1 cgd wrefresh(curscr);
174 1.1 cgd break;
175 1.1 cgd case EOF:
176 1.1 cgd break;
177 1.1 cgd default:
178 1.2 mycroft putchar(CTRL('G'));
179 1.1 cgd reset_count();
180 1.1 cgd fflush(stdout);
181 1.1 cgd break;
182 1.1 cgd }
183 1.1 cgd }
184 1.1 cgd ret:
185 1.1 cgd if (Count > 0)
186 1.1 cgd if (--Count == 0)
187 1.1 cgd leaveok(stdscr, FALSE);
188 1.1 cgd }
189 1.1 cgd
190 1.1 cgd /*
191 1.1 cgd * must_telep:
192 1.1 cgd * Must I teleport; i.e., is there anywhere I can move without
193 1.1 cgd * being eaten?
194 1.1 cgd */
195 1.1 cgd must_telep()
196 1.1 cgd {
197 1.1 cgd register int x, y;
198 1.1 cgd static COORD newpos;
199 1.1 cgd
200 1.1 cgd #ifdef FANCY
201 1.1 cgd if (Stand_still && Num_robots > 1 && eaten(&My_pos))
202 1.1 cgd return TRUE;
203 1.1 cgd #endif
204 1.1 cgd
205 1.1 cgd for (y = -1; y <= 1; y++) {
206 1.1 cgd newpos.y = My_pos.y + y;
207 1.1 cgd if (newpos.y <= 0 || newpos.y >= Y_FIELDSIZE)
208 1.1 cgd continue;
209 1.1 cgd for (x = -1; x <= 1; x++) {
210 1.1 cgd newpos.x = My_pos.x + x;
211 1.1 cgd if (newpos.x <= 0 || newpos.x >= X_FIELDSIZE)
212 1.1 cgd continue;
213 1.1 cgd if (Field[newpos.y][newpos.x] > 0)
214 1.1 cgd continue;
215 1.1 cgd if (!eaten(&newpos))
216 1.1 cgd return FALSE;
217 1.1 cgd }
218 1.1 cgd }
219 1.1 cgd return TRUE;
220 1.1 cgd }
221 1.1 cgd
222 1.1 cgd /*
223 1.1 cgd * do_move:
224 1.1 cgd * Execute a move
225 1.1 cgd */
226 1.1 cgd do_move(dy, dx)
227 1.1 cgd int dy, dx;
228 1.1 cgd {
229 1.1 cgd static COORD newpos;
230 1.1 cgd
231 1.1 cgd newpos.y = My_pos.y + dy;
232 1.1 cgd newpos.x = My_pos.x + dx;
233 1.1 cgd if (newpos.y <= 0 || newpos.y >= Y_FIELDSIZE ||
234 1.1 cgd newpos.x <= 0 || newpos.x >= X_FIELDSIZE ||
235 1.1 cgd Field[newpos.y][newpos.x] > 0 || eaten(&newpos)) {
236 1.1 cgd if (Running) {
237 1.1 cgd Running = FALSE;
238 1.1 cgd leaveok(stdscr, FALSE);
239 1.1 cgd move(My_pos.y, My_pos.x);
240 1.1 cgd refresh();
241 1.1 cgd }
242 1.1 cgd else {
243 1.2 mycroft putchar(CTRL('G'));
244 1.1 cgd reset_count();
245 1.1 cgd }
246 1.1 cgd return FALSE;
247 1.1 cgd }
248 1.1 cgd else if (dy == 0 && dx == 0)
249 1.1 cgd return TRUE;
250 1.1 cgd mvaddch(My_pos.y, My_pos.x, ' ');
251 1.1 cgd My_pos = newpos;
252 1.1 cgd mvaddch(My_pos.y, My_pos.x, PLAYER);
253 1.1 cgd if (!jumping())
254 1.1 cgd refresh();
255 1.1 cgd return TRUE;
256 1.1 cgd }
257 1.1 cgd
258 1.1 cgd /*
259 1.1 cgd * eaten:
260 1.1 cgd * Player would get eaten at this place
261 1.1 cgd */
262 1.1 cgd eaten(pos)
263 1.1 cgd register COORD *pos;
264 1.1 cgd {
265 1.1 cgd register int x, y;
266 1.1 cgd
267 1.1 cgd for (y = pos->y - 1; y <= pos->y + 1; y++) {
268 1.1 cgd if (y <= 0 || y >= Y_FIELDSIZE)
269 1.1 cgd continue;
270 1.1 cgd for (x = pos->x - 1; x <= pos->x + 1; x++) {
271 1.1 cgd if (x <= 0 || x >= X_FIELDSIZE)
272 1.1 cgd continue;
273 1.1 cgd if (Field[y][x] == 1)
274 1.1 cgd return TRUE;
275 1.1 cgd }
276 1.1 cgd }
277 1.1 cgd return FALSE;
278 1.1 cgd }
279 1.1 cgd
280 1.1 cgd /*
281 1.1 cgd * reset_count:
282 1.1 cgd * Reset the count variables
283 1.1 cgd */
284 1.1 cgd reset_count()
285 1.1 cgd {
286 1.1 cgd Count = 0;
287 1.1 cgd Running = FALSE;
288 1.1 cgd leaveok(stdscr, FALSE);
289 1.1 cgd refresh();
290 1.1 cgd }
291 1.1 cgd
292 1.1 cgd /*
293 1.1 cgd * jumping:
294 1.1 cgd * See if we are jumping, i.e., we should not refresh.
295 1.1 cgd */
296 1.1 cgd jumping()
297 1.1 cgd {
298 1.1 cgd return (Jump && (Count || Running || Waiting));
299 1.1 cgd }
300