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