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