move.c revision 1.7 1 1.7 lukem /* $NetBSD: move.c,v 1.7 1997/10/12 00:54:21 lukem Exp $ */
2 1.4 cgd
3 1.1 cgd /*
4 1.3 jtc * Copyright (c) 1983, 1993
5 1.3 jtc * 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.7 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.7 lukem __RCSID("$NetBSD: move.c,v 1.7 1997/10/12 00:54:21 lukem Exp $");
42 1.4 cgd #endif
43 1.1 cgd #endif /* not lint */
44 1.3 jtc
45 1.3 jtc #include <termios.h>
46 1.1 cgd
47 1.1 cgd #include "mille.h"
48 1.1 cgd #ifndef unctrl
49 1.1 cgd #include "unctrl.h"
50 1.1 cgd #endif
51 1.1 cgd
52 1.1 cgd # ifdef attron
53 1.1 cgd # include <term.h>
54 1.1 cgd # endif attron
55 1.1 cgd
56 1.1 cgd /*
57 1.1 cgd * @(#)move.c 1.2 (Berkeley) 3/28/83
58 1.1 cgd */
59 1.1 cgd
60 1.1 cgd #undef CTRL
61 1.1 cgd #define CTRL(c) (c - 'A' + 1)
62 1.1 cgd
63 1.1 cgd char *Movenames[] = {
64 1.1 cgd "M_DISCARD", "M_DRAW", "M_PLAY", "M_ORDER"
65 1.1 cgd };
66 1.1 cgd
67 1.7 lukem void
68 1.1 cgd domove()
69 1.1 cgd {
70 1.7 lukem PLAY *pp;
71 1.7 lukem int i, j;
72 1.7 lukem bool goodplay;
73 1.1 cgd
74 1.1 cgd pp = &Player[Play];
75 1.1 cgd if (Play == PLAYER)
76 1.1 cgd getmove();
77 1.1 cgd else
78 1.1 cgd calcmove();
79 1.1 cgd Next = FALSE;
80 1.1 cgd goodplay = TRUE;
81 1.1 cgd switch (Movetype) {
82 1.1 cgd case M_DISCARD:
83 1.1 cgd if (haspicked(pp)) {
84 1.1 cgd if (pp->hand[Card_no] == C_INIT)
85 1.1 cgd if (Card_no == 6)
86 1.1 cgd Finished = TRUE;
87 1.1 cgd else
88 1.1 cgd error("no card there");
89 1.1 cgd else {
90 1.1 cgd if (issafety(pp->hand[Card_no])) {
91 1.1 cgd error("discard a safety?");
92 1.1 cgd goodplay = FALSE;
93 1.1 cgd break;
94 1.1 cgd }
95 1.1 cgd Discard = pp->hand[Card_no];
96 1.1 cgd pp->hand[Card_no] = C_INIT;
97 1.1 cgd Next = TRUE;
98 1.1 cgd if (Play == PLAYER)
99 1.1 cgd account(Discard);
100 1.1 cgd }
101 1.1 cgd }
102 1.1 cgd else
103 1.1 cgd error("must pick first");
104 1.1 cgd break;
105 1.1 cgd case M_PLAY:
106 1.1 cgd goodplay = playcard(pp);
107 1.1 cgd break;
108 1.1 cgd case M_DRAW:
109 1.1 cgd Card_no = 0;
110 1.1 cgd if (Topcard <= Deck)
111 1.1 cgd error("no more cards");
112 1.1 cgd else if (haspicked(pp))
113 1.1 cgd error("already picked");
114 1.1 cgd else {
115 1.1 cgd pp->hand[0] = *--Topcard;
116 1.1 cgd #ifdef DEBUG
117 1.1 cgd if (Debug)
118 1.1 cgd fprintf(outf, "DOMOVE: Draw %s\n", C_name[*Topcard]);
119 1.1 cgd #endif
120 1.1 cgd acc:
121 1.1 cgd if (Play == COMP) {
122 1.1 cgd account(*Topcard);
123 1.1 cgd if (issafety(*Topcard))
124 1.1 cgd pp->safety[*Topcard-S_CONV] = S_IN_HAND;
125 1.1 cgd }
126 1.1 cgd if (pp->hand[1] == C_INIT && Topcard > Deck) {
127 1.1 cgd Card_no = 1;
128 1.1 cgd pp->hand[1] = *--Topcard;
129 1.1 cgd #ifdef DEBUG
130 1.1 cgd if (Debug)
131 1.1 cgd fprintf(outf, "DOMOVE: Draw %s\n", C_name[*Topcard]);
132 1.1 cgd #endif
133 1.1 cgd goto acc;
134 1.1 cgd }
135 1.1 cgd pp->new_battle = FALSE;
136 1.1 cgd pp->new_speed = FALSE;
137 1.1 cgd }
138 1.1 cgd break;
139 1.1 cgd
140 1.1 cgd case M_ORDER:
141 1.1 cgd break;
142 1.1 cgd }
143 1.1 cgd /*
144 1.1 cgd * move blank card to top by one of two methods. If the
145 1.1 cgd * computer's hand was sorted, the randomness for picking
146 1.1 cgd * between equally valued cards would be lost
147 1.1 cgd */
148 1.1 cgd if (Order && Movetype != M_DRAW && goodplay && pp == &Player[PLAYER])
149 1.1 cgd sort(pp->hand);
150 1.1 cgd else
151 1.1 cgd for (i = 1; i < HAND_SZ; i++)
152 1.1 cgd if (pp->hand[i] == C_INIT) {
153 1.1 cgd for (j = 0; pp->hand[j] == C_INIT; j++)
154 1.1 cgd if (j >= HAND_SZ) {
155 1.1 cgd j = 0;
156 1.1 cgd break;
157 1.1 cgd }
158 1.1 cgd pp->hand[i] = pp->hand[j];
159 1.1 cgd pp->hand[j] = C_INIT;
160 1.1 cgd }
161 1.1 cgd if (Topcard <= Deck)
162 1.1 cgd check_go();
163 1.1 cgd if (Next)
164 1.1 cgd nextplay();
165 1.1 cgd }
166 1.1 cgd
167 1.1 cgd /*
168 1.1 cgd * Check and see if either side can go. If they cannot,
169 1.1 cgd * the game is over
170 1.1 cgd */
171 1.7 lukem void
172 1.7 lukem check_go()
173 1.7 lukem {
174 1.7 lukem CARD card;
175 1.7 lukem PLAY *pp, *op;
176 1.7 lukem int i;
177 1.1 cgd
178 1.1 cgd for (pp = Player; pp < &Player[2]; pp++) {
179 1.1 cgd op = (pp == &Player[COMP] ? &Player[PLAYER] : &Player[COMP]);
180 1.1 cgd for (i = 0; i < HAND_SZ; i++) {
181 1.1 cgd card = pp->hand[i];
182 1.1 cgd if (issafety(card) || canplay(pp, op, card)) {
183 1.1 cgd #ifdef DEBUG
184 1.1 cgd if (Debug) {
185 1.1 cgd fprintf(outf, "CHECK_GO: can play %s (%d), ", C_name[card], card);
186 1.1 cgd fprintf(outf, "issafety(card) = %d, ", issafety(card));
187 1.1 cgd fprintf(outf, "canplay(pp, op, card) = %d\n", canplay(pp, op, card));
188 1.1 cgd }
189 1.1 cgd #endif
190 1.1 cgd return;
191 1.1 cgd }
192 1.1 cgd #ifdef DEBUG
193 1.1 cgd else if (Debug)
194 1.1 cgd fprintf(outf, "CHECK_GO: cannot play %s\n",
195 1.1 cgd C_name[card]);
196 1.1 cgd #endif
197 1.1 cgd }
198 1.1 cgd }
199 1.1 cgd Finished = TRUE;
200 1.1 cgd }
201 1.1 cgd
202 1.7 lukem int
203 1.1 cgd playcard(pp)
204 1.7 lukem PLAY *pp;
205 1.1 cgd {
206 1.7 lukem int v;
207 1.7 lukem CARD card;
208 1.1 cgd
209 1.1 cgd /*
210 1.1 cgd * check and see if player has picked
211 1.1 cgd */
212 1.1 cgd switch (pp->hand[Card_no]) {
213 1.1 cgd default:
214 1.1 cgd if (!haspicked(pp))
215 1.1 cgd mustpick:
216 1.1 cgd return error("must pick first");
217 1.1 cgd case C_GAS_SAFE: case C_SPARE_SAFE:
218 1.1 cgd case C_DRIVE_SAFE: case C_RIGHT_WAY:
219 1.1 cgd break;
220 1.1 cgd }
221 1.1 cgd
222 1.1 cgd card = pp->hand[Card_no];
223 1.1 cgd #ifdef DEBUG
224 1.1 cgd if (Debug)
225 1.1 cgd fprintf(outf, "PLAYCARD: Card = %s\n", C_name[card]);
226 1.1 cgd #endif
227 1.1 cgd Next = FALSE;
228 1.1 cgd switch (card) {
229 1.1 cgd case C_200:
230 1.1 cgd if (pp->nummiles[C_200] == 2)
231 1.1 cgd return error("only two 200's per hand");
232 1.1 cgd case C_100: case C_75:
233 1.1 cgd if (pp->speed == C_LIMIT)
234 1.1 cgd return error("limit of 50");
235 1.1 cgd case C_50:
236 1.1 cgd if (pp->mileage + Value[card] > End)
237 1.1 cgd return error("puts you over %d", End);
238 1.1 cgd case C_25:
239 1.1 cgd if (!pp->can_go)
240 1.1 cgd return error("cannot move now");
241 1.1 cgd pp->nummiles[card]++;
242 1.1 cgd v = Value[card];
243 1.1 cgd pp->total += v;
244 1.1 cgd pp->hand_tot += v;
245 1.1 cgd if ((pp->mileage += v) == End)
246 1.1 cgd check_ext(FALSE);
247 1.1 cgd break;
248 1.1 cgd
249 1.1 cgd case C_GAS: case C_SPARE: case C_REPAIRS:
250 1.1 cgd if (pp->battle != opposite(card))
251 1.1 cgd return error("can't play \"%s\"", C_name[card]);
252 1.1 cgd pp->battle = card;
253 1.1 cgd if (pp->safety[S_RIGHT_WAY] == S_PLAYED)
254 1.1 cgd pp->can_go = TRUE;
255 1.1 cgd break;
256 1.1 cgd
257 1.1 cgd case C_GO:
258 1.1 cgd if (pp->battle != C_INIT && pp->battle != C_STOP
259 1.1 cgd && !isrepair(pp->battle))
260 1.1 cgd return error("cannot play \"Go\" on a \"%s\"",
261 1.1 cgd C_name[pp->battle]);
262 1.1 cgd pp->battle = C_GO;
263 1.1 cgd pp->can_go = TRUE;
264 1.1 cgd break;
265 1.1 cgd
266 1.1 cgd case C_END_LIMIT:
267 1.1 cgd if (pp->speed != C_LIMIT)
268 1.1 cgd return error("not limited");
269 1.1 cgd pp->speed = C_END_LIMIT;
270 1.1 cgd break;
271 1.1 cgd
272 1.1 cgd case C_EMPTY: case C_FLAT: case C_CRASH:
273 1.1 cgd case C_STOP:
274 1.1 cgd pp = &Player[other(Play)];
275 1.1 cgd if (!pp->can_go)
276 1.1 cgd return error("opponent cannot go");
277 1.1 cgd else if (pp->safety[safety(card) - S_CONV] == S_PLAYED)
278 1.1 cgd protected:
279 1.1 cgd return error("opponent is protected");
280 1.1 cgd pp->battle = card;
281 1.1 cgd pp->new_battle = TRUE;
282 1.1 cgd pp->can_go = FALSE;
283 1.1 cgd pp = &Player[Play];
284 1.1 cgd break;
285 1.1 cgd
286 1.1 cgd case C_LIMIT:
287 1.1 cgd pp = &Player[other(Play)];
288 1.1 cgd if (pp->speed == C_LIMIT)
289 1.1 cgd return error("opponent has limit");
290 1.1 cgd if (pp->safety[S_RIGHT_WAY] == S_PLAYED)
291 1.1 cgd goto protected;
292 1.1 cgd pp->speed = C_LIMIT;
293 1.1 cgd pp->new_speed = TRUE;
294 1.1 cgd pp = &Player[Play];
295 1.1 cgd break;
296 1.1 cgd
297 1.1 cgd case C_GAS_SAFE: case C_SPARE_SAFE:
298 1.1 cgd case C_DRIVE_SAFE: case C_RIGHT_WAY:
299 1.1 cgd if (pp->battle == opposite(card)
300 1.1 cgd || (card == C_RIGHT_WAY && pp->speed == C_LIMIT)) {
301 1.1 cgd if (!(card == C_RIGHT_WAY && !isrepair(pp->battle))) {
302 1.1 cgd pp->battle = C_GO;
303 1.1 cgd pp->can_go = TRUE;
304 1.1 cgd }
305 1.1 cgd if (card == C_RIGHT_WAY && pp->speed == C_LIMIT)
306 1.1 cgd pp->speed = C_INIT;
307 1.1 cgd if (pp->new_battle
308 1.1 cgd || (pp->new_speed && card == C_RIGHT_WAY)) {
309 1.1 cgd pp->coups[card - S_CONV] = TRUE;
310 1.1 cgd pp->total += SC_COUP;
311 1.1 cgd pp->hand_tot += SC_COUP;
312 1.1 cgd pp->coupscore += SC_COUP;
313 1.1 cgd }
314 1.1 cgd }
315 1.1 cgd /*
316 1.1 cgd * if not coup, must pick first
317 1.1 cgd */
318 1.1 cgd else if (pp->hand[0] == C_INIT && Topcard > Deck)
319 1.1 cgd goto mustpick;
320 1.1 cgd pp->safety[card - S_CONV] = S_PLAYED;
321 1.1 cgd pp->total += SC_SAFETY;
322 1.1 cgd pp->hand_tot += SC_SAFETY;
323 1.1 cgd if ((pp->safescore += SC_SAFETY) == NUM_SAFE * SC_SAFETY) {
324 1.1 cgd pp->total += SC_ALL_SAFE;
325 1.1 cgd pp->hand_tot += SC_ALL_SAFE;
326 1.1 cgd }
327 1.1 cgd if (card == C_RIGHT_WAY) {
328 1.1 cgd if (pp->speed == C_LIMIT)
329 1.1 cgd pp->speed = C_INIT;
330 1.1 cgd if (pp->battle == C_STOP || pp->battle == C_INIT) {
331 1.1 cgd pp->can_go = TRUE;
332 1.1 cgd pp->battle = C_INIT;
333 1.1 cgd }
334 1.1 cgd if (!pp->can_go && isrepair(pp->battle))
335 1.1 cgd pp->can_go = TRUE;
336 1.1 cgd }
337 1.1 cgd Next = -1;
338 1.1 cgd break;
339 1.1 cgd
340 1.1 cgd case C_INIT:
341 1.1 cgd error("no card there");
342 1.1 cgd Next = -1;
343 1.1 cgd break;
344 1.1 cgd }
345 1.1 cgd if (pp == &Player[PLAYER])
346 1.1 cgd account(card);
347 1.1 cgd pp->hand[Card_no] = C_INIT;
348 1.5 thorpej Next = (Next == (bool)-1 ? FALSE : TRUE);
349 1.1 cgd return TRUE;
350 1.1 cgd }
351 1.1 cgd
352 1.7 lukem void
353 1.1 cgd getmove()
354 1.1 cgd {
355 1.7 lukem char c;
356 1.1 cgd #ifdef EXTRAP
357 1.1 cgd static bool last_ex = FALSE; /* set if last command was E */
358 1.1 cgd
359 1.1 cgd if (last_ex) {
360 1.1 cgd undoex();
361 1.1 cgd prboard();
362 1.1 cgd last_ex = FALSE;
363 1.1 cgd }
364 1.1 cgd #endif
365 1.1 cgd for (;;) {
366 1.1 cgd prompt(MOVEPROMPT);
367 1.1 cgd leaveok(Board, FALSE);
368 1.1 cgd refresh();
369 1.1 cgd while ((c = readch()) == killchar() || c == erasechar())
370 1.1 cgd continue;
371 1.1 cgd if (islower(c))
372 1.1 cgd c = toupper(c);
373 1.1 cgd if (isprint(c) && !isspace(c)) {
374 1.1 cgd addch(c);
375 1.1 cgd refresh();
376 1.1 cgd }
377 1.1 cgd switch (c) {
378 1.1 cgd case 'P': /* Pick */
379 1.1 cgd Movetype = M_DRAW;
380 1.1 cgd goto ret;
381 1.1 cgd case 'U': /* Use Card */
382 1.1 cgd case 'D': /* Discard Card */
383 1.1 cgd if ((Card_no = getcard()) < 0)
384 1.1 cgd break;
385 1.1 cgd Movetype = (c == 'U' ? M_PLAY : M_DISCARD);
386 1.1 cgd goto ret;
387 1.1 cgd case 'O': /* Order */
388 1.1 cgd Order = !Order;
389 1.1 cgd if (Window == W_SMALL) {
390 1.1 cgd if (!Order)
391 1.1 cgd mvwaddstr(Score, 12, 21,
392 1.1 cgd "o: order hand");
393 1.1 cgd else
394 1.1 cgd mvwaddstr(Score, 12, 21,
395 1.1 cgd "o: stop ordering");
396 1.1 cgd wclrtoeol(Score);
397 1.1 cgd }
398 1.1 cgd Movetype = M_ORDER;
399 1.1 cgd goto ret;
400 1.1 cgd case 'Q': /* Quit */
401 1.7 lukem rub(0); /* Same as a rubout */
402 1.1 cgd break;
403 1.1 cgd case 'W': /* Window toggle */
404 1.1 cgd Window = nextwin(Window);
405 1.1 cgd newscore();
406 1.1 cgd prscore(TRUE);
407 1.1 cgd wrefresh(Score);
408 1.1 cgd break;
409 1.1 cgd case 'R': /* Redraw screen */
410 1.1 cgd case CTRL('L'):
411 1.1 cgd wrefresh(curscr);
412 1.1 cgd break;
413 1.1 cgd case 'S': /* Save game */
414 1.1 cgd On_exit = FALSE;
415 1.1 cgd save();
416 1.1 cgd break;
417 1.1 cgd case 'E': /* Extrapolate */
418 1.1 cgd #ifdef EXTRAP
419 1.1 cgd if (last_ex)
420 1.1 cgd break;
421 1.1 cgd Finished = TRUE;
422 1.1 cgd if (Window != W_FULL)
423 1.1 cgd newscore();
424 1.1 cgd prscore(FALSE);
425 1.1 cgd wrefresh(Score);
426 1.1 cgd last_ex = TRUE;
427 1.1 cgd Finished = FALSE;
428 1.1 cgd #else
429 1.1 cgd error("%c: command not implemented", c);
430 1.1 cgd #endif
431 1.1 cgd break;
432 1.1 cgd case '\r': /* Ignore RETURNs and */
433 1.1 cgd case '\n': /* Line Feeds */
434 1.1 cgd case ' ': /* Spaces */
435 1.1 cgd case '\0': /* and nulls */
436 1.1 cgd break;
437 1.1 cgd #ifdef DEBUG
438 1.1 cgd case 'Z': /* Debug code */
439 1.1 cgd if (!Debug && outf == NULL) {
440 1.1 cgd char buf[MAXPATHLEN];
441 1.1 cgd
442 1.1 cgd prompt(FILEPROMPT);
443 1.1 cgd leaveok(Board, FALSE);
444 1.1 cgd refresh();
445 1.1 cgd sp = buf;
446 1.1 cgd while ((*sp = readch()) != '\n') {
447 1.1 cgd if (*sp == killchar())
448 1.1 cgd goto over;
449 1.1 cgd else if (*sp == erasechar()) {
450 1.1 cgd if (--sp < buf)
451 1.1 cgd sp = buf;
452 1.1 cgd else {
453 1.1 cgd addch('\b');
454 1.1 cgd if (*sp < ' ')
455 1.1 cgd addch('\b');
456 1.1 cgd clrtoeol();
457 1.1 cgd }
458 1.1 cgd }
459 1.1 cgd else
460 1.1 cgd addstr(unctrl(*sp++));
461 1.1 cgd refresh();
462 1.1 cgd }
463 1.1 cgd *sp = '\0';
464 1.1 cgd leaveok(Board, TRUE);
465 1.1 cgd if ((outf = fopen(buf, "w")) == NULL)
466 1.7 lukem warn("%s", buf);
467 1.1 cgd setbuf(outf, (char *)NULL);
468 1.1 cgd }
469 1.1 cgd Debug = !Debug;
470 1.1 cgd break;
471 1.1 cgd #endif
472 1.1 cgd default:
473 1.1 cgd error("unknown command: %s", unctrl(c));
474 1.1 cgd break;
475 1.1 cgd }
476 1.1 cgd }
477 1.1 cgd ret:
478 1.1 cgd leaveok(Board, TRUE);
479 1.1 cgd }
480 1.7 lukem
481 1.1 cgd /*
482 1.1 cgd * return whether or not the player has picked
483 1.1 cgd */
484 1.7 lukem int
485 1.1 cgd haspicked(pp)
486 1.7 lukem PLAY *pp;
487 1.6 jtc {
488 1.7 lukem int card;
489 1.1 cgd
490 1.1 cgd if (Topcard <= Deck)
491 1.1 cgd return TRUE;
492 1.1 cgd switch (pp->hand[Card_no]) {
493 1.1 cgd case C_GAS_SAFE: case C_SPARE_SAFE:
494 1.1 cgd case C_DRIVE_SAFE: case C_RIGHT_WAY:
495 1.1 cgd card = 1;
496 1.1 cgd break;
497 1.1 cgd default:
498 1.1 cgd card = 0;
499 1.1 cgd break;
500 1.1 cgd }
501 1.1 cgd return (pp->hand[card] != C_INIT);
502 1.1 cgd }
503 1.1 cgd
504 1.7 lukem void
505 1.1 cgd account(card)
506 1.7 lukem CARD card;
507 1.6 jtc {
508 1.7 lukem CARD oppos;
509 1.1 cgd
510 1.1 cgd if (card == C_INIT)
511 1.1 cgd return;
512 1.1 cgd ++Numseen[card];
513 1.1 cgd if (Play == COMP)
514 1.1 cgd switch (card) {
515 1.1 cgd case C_GAS_SAFE:
516 1.1 cgd case C_SPARE_SAFE:
517 1.1 cgd case C_DRIVE_SAFE:
518 1.1 cgd oppos = opposite(card);
519 1.1 cgd Numgos += Numcards[oppos] - Numseen[oppos];
520 1.1 cgd break;
521 1.1 cgd case C_CRASH:
522 1.1 cgd case C_FLAT:
523 1.1 cgd case C_EMPTY:
524 1.1 cgd case C_STOP:
525 1.1 cgd Numgos++;
526 1.1 cgd break;
527 1.1 cgd }
528 1.1 cgd }
529 1.1 cgd
530 1.7 lukem void
531 1.1 cgd prompt(promptno)
532 1.7 lukem int promptno;
533 1.1 cgd {
534 1.1 cgd static char *names[] = {
535 1.1 cgd ">>:Move:",
536 1.1 cgd "Really?",
537 1.1 cgd "Another hand?",
538 1.1 cgd "Another game?",
539 1.1 cgd "Save game?",
540 1.1 cgd "Same file?",
541 1.1 cgd "file:",
542 1.1 cgd "Extension?",
543 1.1 cgd "Overwrite file?",
544 1.1 cgd };
545 1.1 cgd static int last_prompt = -1;
546 1.1 cgd
547 1.1 cgd if (promptno == last_prompt)
548 1.1 cgd move(MOVE_Y, MOVE_X + strlen(names[promptno]) + 1);
549 1.1 cgd else {
550 1.1 cgd move(MOVE_Y, MOVE_X);
551 1.1 cgd if (promptno == MOVEPROMPT)
552 1.1 cgd standout();
553 1.1 cgd addstr(names[promptno]);
554 1.1 cgd if (promptno == MOVEPROMPT)
555 1.1 cgd standend();
556 1.1 cgd addch(' ');
557 1.1 cgd last_prompt = promptno;
558 1.1 cgd }
559 1.1 cgd clrtoeol();
560 1.1 cgd }
561 1.1 cgd
562 1.7 lukem void
563 1.1 cgd sort(hand)
564 1.7 lukem CARD *hand;
565 1.1 cgd {
566 1.7 lukem CARD *cp, *tp;
567 1.7 lukem CARD temp;
568 1.1 cgd
569 1.1 cgd cp = hand;
570 1.1 cgd hand += HAND_SZ;
571 1.1 cgd for ( ; cp < &hand[-1]; cp++)
572 1.1 cgd for (tp = cp + 1; tp < hand; tp++)
573 1.1 cgd if (*cp > *tp) {
574 1.1 cgd temp = *cp;
575 1.1 cgd *cp = *tp;
576 1.1 cgd *tp = temp;
577 1.1 cgd }
578 1.1 cgd }
579