fish.c revision 1.13 1 1.13 mycroft /* $NetBSD: fish.c,v 1.13 2000/05/08 07:56:03 mycroft Exp $ */
2 1.3 cgd
3 1.1 cgd /*-
4 1.3 cgd * Copyright (c) 1990, 1993
5 1.3 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley by
8 1.1 cgd * Muffy Barkocy.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.1 cgd * 3. All advertising materials mentioning features or use of this software
19 1.1 cgd * must display the following acknowledgement:
20 1.1 cgd * This product includes software developed by the University of
21 1.1 cgd * California, Berkeley and its contributors.
22 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
23 1.1 cgd * may be used to endorse or promote products derived from this software
24 1.1 cgd * without specific prior written permission.
25 1.1 cgd *
26 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 cgd * SUCH DAMAGE.
37 1.1 cgd */
38 1.1 cgd
39 1.4 lukem #include <sys/cdefs.h>
40 1.1 cgd #ifndef lint
41 1.4 lukem __COPYRIGHT("@(#) Copyright (c) 1990, 1993\n\
42 1.4 lukem The Regents of the University of California. All rights reserved.\n");
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.1 cgd #ifndef lint
46 1.3 cgd #if 0
47 1.3 cgd static char sccsid[] = "@(#)fish.c 8.1 (Berkeley) 5/31/93";
48 1.3 cgd #else
49 1.13 mycroft __RCSID("$NetBSD: fish.c,v 1.13 2000/05/08 07:56:03 mycroft Exp $");
50 1.3 cgd #endif
51 1.1 cgd #endif /* not lint */
52 1.1 cgd
53 1.1 cgd #include <sys/types.h>
54 1.5 christos #include <sys/wait.h>
55 1.5 christos #include <errno.h>
56 1.1 cgd #include <fcntl.h>
57 1.1 cgd #include <stdio.h>
58 1.1 cgd #include <stdlib.h>
59 1.5 christos #include <unistd.h>
60 1.1 cgd #include <string.h>
61 1.4 lukem #include <time.h>
62 1.5 christos #include <err.h>
63 1.1 cgd #include "pathnames.h"
64 1.1 cgd
65 1.1 cgd #define RANKS 13
66 1.1 cgd #define HANDSIZE 7
67 1.1 cgd #define CARDS 4
68 1.12 tron #define TOTCARDS RANKS * CARDS
69 1.1 cgd
70 1.1 cgd #define USER 1
71 1.1 cgd #define COMPUTER 0
72 1.1 cgd #define OTHER(a) (1 - (a))
73 1.1 cgd
74 1.9 jsm const char *const cards[] = {
75 1.1 cgd "A", "2", "3", "4", "5", "6", "7",
76 1.1 cgd "8", "9", "10", "J", "Q", "K", NULL,
77 1.1 cgd };
78 1.1 cgd #define PRC(card) (void)printf(" %s", cards[card])
79 1.1 cgd
80 1.1 cgd int promode;
81 1.12 tron int asked[RANKS], comphand[RANKS], deck[TOTCARDS];
82 1.1 cgd int userasked[RANKS], userhand[RANKS];
83 1.12 tron int curcard = TOTCARDS;
84 1.1 cgd
85 1.9 jsm void chkwinner __P((int, const int *));
86 1.4 lukem int compmove __P((void));
87 1.9 jsm int countbooks __P((const int *));
88 1.9 jsm int countcards __P((const int *));
89 1.4 lukem int drawcard __P((int, int *));
90 1.4 lukem int gofish __P((int, int, int *));
91 1.4 lukem void goodmove __P((int, int, int *, int *));
92 1.4 lukem void init __P((void));
93 1.4 lukem void instructions __P((void));
94 1.4 lukem int main __P((int, char *[]));
95 1.4 lukem int nrandom __P((int));
96 1.9 jsm void printhand __P((const int *));
97 1.4 lukem void printplayer __P((int));
98 1.4 lukem int promove __P((void));
99 1.6 hubertf void usage __P((void)) __attribute__((__noreturn__));
100 1.4 lukem int usermove __P((void));
101 1.4 lukem
102 1.4 lukem int
103 1.1 cgd main(argc, argv)
104 1.1 cgd int argc;
105 1.1 cgd char **argv;
106 1.1 cgd {
107 1.1 cgd int ch, move;
108 1.1 cgd
109 1.10 jsm /* Revoke setgid privileges */
110 1.13 mycroft setgid(getgid());
111 1.8 hubertf
112 1.4 lukem while ((ch = getopt(argc, argv, "p")) != -1)
113 1.1 cgd switch(ch) {
114 1.1 cgd case 'p':
115 1.1 cgd promode = 1;
116 1.1 cgd break;
117 1.1 cgd case '?':
118 1.1 cgd default:
119 1.11 jsm usage();
120 1.1 cgd }
121 1.1 cgd
122 1.1 cgd srandom(time((time_t *)NULL));
123 1.1 cgd instructions();
124 1.1 cgd init();
125 1.1 cgd
126 1.1 cgd if (nrandom(2) == 1) {
127 1.1 cgd printplayer(COMPUTER);
128 1.1 cgd (void)printf("get to start.\n");
129 1.1 cgd goto istart;
130 1.1 cgd }
131 1.1 cgd printplayer(USER);
132 1.1 cgd (void)printf("get to start.\n");
133 1.1 cgd
134 1.1 cgd for (;;) {
135 1.1 cgd move = usermove();
136 1.1 cgd if (!comphand[move]) {
137 1.1 cgd if (gofish(move, USER, userhand))
138 1.1 cgd continue;
139 1.1 cgd } else {
140 1.1 cgd goodmove(USER, move, userhand, comphand);
141 1.1 cgd continue;
142 1.1 cgd }
143 1.1 cgd
144 1.1 cgd istart: for (;;) {
145 1.1 cgd move = compmove();
146 1.1 cgd if (!userhand[move]) {
147 1.1 cgd if (!gofish(move, COMPUTER, comphand))
148 1.1 cgd break;
149 1.1 cgd } else
150 1.1 cgd goodmove(COMPUTER, move, comphand, userhand);
151 1.1 cgd }
152 1.1 cgd }
153 1.1 cgd /* NOTREACHED */
154 1.1 cgd }
155 1.1 cgd
156 1.4 lukem int
157 1.1 cgd usermove()
158 1.1 cgd {
159 1.4 lukem int n;
160 1.9 jsm const char *const *p;
161 1.1 cgd char buf[256];
162 1.1 cgd
163 1.1 cgd (void)printf("\nYour hand is:");
164 1.1 cgd printhand(userhand);
165 1.1 cgd
166 1.1 cgd for (;;) {
167 1.1 cgd (void)printf("You ask me for: ");
168 1.1 cgd (void)fflush(stdout);
169 1.7 kristerw if (fgets(buf, sizeof(buf), stdin) == NULL)
170 1.1 cgd exit(0);
171 1.1 cgd if (buf[0] == '\0')
172 1.1 cgd continue;
173 1.1 cgd if (buf[0] == '\n') {
174 1.1 cgd (void)printf("%d cards in my hand, %d in the pool.\n",
175 1.12 tron countcards(comphand), curcard);
176 1.1 cgd (void)printf("My books:");
177 1.1 cgd (void)countbooks(comphand);
178 1.1 cgd continue;
179 1.1 cgd }
180 1.1 cgd buf[strlen(buf) - 1] = '\0';
181 1.1 cgd if (!strcasecmp(buf, "p") && !promode) {
182 1.1 cgd promode = 1;
183 1.1 cgd (void)printf("Entering pro mode.\n");
184 1.1 cgd continue;
185 1.1 cgd }
186 1.1 cgd if (!strcasecmp(buf, "quit"))
187 1.1 cgd exit(0);
188 1.1 cgd for (p = cards; *p; ++p)
189 1.1 cgd if (!strcasecmp(*p, buf))
190 1.1 cgd break;
191 1.1 cgd if (!*p) {
192 1.1 cgd (void)printf("I don't understand!\n");
193 1.1 cgd continue;
194 1.1 cgd }
195 1.1 cgd n = p - cards;
196 1.1 cgd if (userhand[n]) {
197 1.1 cgd userasked[n] = 1;
198 1.1 cgd return(n);
199 1.1 cgd }
200 1.1 cgd if (nrandom(3) == 1)
201 1.1 cgd (void)printf("You don't have any of those!\n");
202 1.1 cgd else
203 1.1 cgd (void)printf("You don't have any %s's!\n", cards[n]);
204 1.1 cgd if (nrandom(4) == 1)
205 1.1 cgd (void)printf("No cheating!\n");
206 1.1 cgd (void)printf("Guess again.\n");
207 1.1 cgd }
208 1.1 cgd /* NOTREACHED */
209 1.1 cgd }
210 1.1 cgd
211 1.4 lukem int
212 1.1 cgd compmove()
213 1.1 cgd {
214 1.1 cgd static int lmove;
215 1.1 cgd
216 1.1 cgd if (promode)
217 1.1 cgd lmove = promove();
218 1.1 cgd else {
219 1.1 cgd do {
220 1.1 cgd lmove = (lmove + 1) % RANKS;
221 1.1 cgd } while (!comphand[lmove] || comphand[lmove] == CARDS);
222 1.1 cgd }
223 1.1 cgd asked[lmove] = 1;
224 1.1 cgd
225 1.1 cgd (void)printf("I ask you for: %s.\n", cards[lmove]);
226 1.1 cgd return(lmove);
227 1.1 cgd }
228 1.1 cgd
229 1.4 lukem int
230 1.1 cgd promove()
231 1.1 cgd {
232 1.4 lukem int i, max;
233 1.1 cgd
234 1.1 cgd for (i = 0; i < RANKS; ++i)
235 1.1 cgd if (userasked[i] &&
236 1.1 cgd comphand[i] > 0 && comphand[i] < CARDS) {
237 1.1 cgd userasked[i] = 0;
238 1.1 cgd return(i);
239 1.1 cgd }
240 1.1 cgd if (nrandom(3) == 1) {
241 1.1 cgd for (i = 0;; ++i)
242 1.1 cgd if (comphand[i] && comphand[i] != CARDS) {
243 1.1 cgd max = i;
244 1.1 cgd break;
245 1.1 cgd }
246 1.1 cgd while (++i < RANKS)
247 1.1 cgd if (comphand[i] != CARDS &&
248 1.1 cgd comphand[i] > comphand[max])
249 1.1 cgd max = i;
250 1.1 cgd return(max);
251 1.1 cgd }
252 1.1 cgd if (nrandom(1024) == 0723) {
253 1.1 cgd for (i = 0; i < RANKS; ++i)
254 1.1 cgd if (userhand[i] && comphand[i])
255 1.1 cgd return(i);
256 1.1 cgd }
257 1.1 cgd for (;;) {
258 1.1 cgd for (i = 0; i < RANKS; ++i)
259 1.1 cgd if (comphand[i] && comphand[i] != CARDS &&
260 1.1 cgd !asked[i])
261 1.1 cgd return(i);
262 1.1 cgd for (i = 0; i < RANKS; ++i)
263 1.1 cgd asked[i] = 0;
264 1.1 cgd }
265 1.1 cgd /* NOTREACHED */
266 1.1 cgd }
267 1.1 cgd
268 1.4 lukem int
269 1.1 cgd drawcard(player, hand)
270 1.1 cgd int player;
271 1.1 cgd int *hand;
272 1.1 cgd {
273 1.1 cgd int card;
274 1.1 cgd
275 1.12 tron ++hand[card = deck[--curcard]];
276 1.1 cgd if (player == USER || hand[card] == CARDS) {
277 1.1 cgd printplayer(player);
278 1.1 cgd (void)printf("drew %s", cards[card]);
279 1.1 cgd if (hand[card] == CARDS) {
280 1.1 cgd (void)printf(" and made a book of %s's!\n",
281 1.1 cgd cards[card]);
282 1.1 cgd chkwinner(player, hand);
283 1.1 cgd } else
284 1.1 cgd (void)printf(".\n");
285 1.1 cgd }
286 1.1 cgd return(card);
287 1.1 cgd }
288 1.1 cgd
289 1.4 lukem int
290 1.1 cgd gofish(askedfor, player, hand)
291 1.1 cgd int askedfor, player;
292 1.1 cgd int *hand;
293 1.1 cgd {
294 1.1 cgd printplayer(OTHER(player));
295 1.1 cgd (void)printf("say \"GO FISH!\"\n");
296 1.1 cgd if (askedfor == drawcard(player, hand)) {
297 1.1 cgd printplayer(player);
298 1.1 cgd (void)printf("drew the guess!\n");
299 1.1 cgd printplayer(player);
300 1.1 cgd (void)printf("get to ask again!\n");
301 1.1 cgd return(1);
302 1.1 cgd }
303 1.1 cgd return(0);
304 1.1 cgd }
305 1.1 cgd
306 1.4 lukem void
307 1.1 cgd goodmove(player, move, hand, opphand)
308 1.1 cgd int player, move;
309 1.1 cgd int *hand, *opphand;
310 1.1 cgd {
311 1.1 cgd printplayer(OTHER(player));
312 1.1 cgd (void)printf("have %d %s%s.\n",
313 1.1 cgd opphand[move], cards[move], opphand[move] == 1 ? "": "'s");
314 1.1 cgd
315 1.1 cgd hand[move] += opphand[move];
316 1.1 cgd opphand[move] = 0;
317 1.1 cgd
318 1.1 cgd if (hand[move] == CARDS) {
319 1.1 cgd printplayer(player);
320 1.1 cgd (void)printf("made a book of %s's!\n", cards[move]);
321 1.1 cgd chkwinner(player, hand);
322 1.1 cgd }
323 1.1 cgd
324 1.1 cgd chkwinner(OTHER(player), opphand);
325 1.1 cgd
326 1.1 cgd printplayer(player);
327 1.1 cgd (void)printf("get another guess!\n");
328 1.1 cgd }
329 1.1 cgd
330 1.4 lukem void
331 1.1 cgd chkwinner(player, hand)
332 1.1 cgd int player;
333 1.9 jsm const int *hand;
334 1.1 cgd {
335 1.4 lukem int cb, i, ub;
336 1.1 cgd
337 1.1 cgd for (i = 0; i < RANKS; ++i)
338 1.1 cgd if (hand[i] > 0 && hand[i] < CARDS)
339 1.1 cgd return;
340 1.1 cgd printplayer(player);
341 1.1 cgd (void)printf("don't have any more cards!\n");
342 1.1 cgd (void)printf("My books:");
343 1.1 cgd cb = countbooks(comphand);
344 1.1 cgd (void)printf("Your books:");
345 1.1 cgd ub = countbooks(userhand);
346 1.1 cgd (void)printf("\nI have %d, you have %d.\n", cb, ub);
347 1.1 cgd if (ub > cb) {
348 1.1 cgd (void)printf("\nYou win!!!\n");
349 1.1 cgd if (nrandom(1024) == 0723)
350 1.1 cgd (void)printf("Cheater, cheater, pumpkin eater!\n");
351 1.1 cgd } else if (cb > ub) {
352 1.1 cgd (void)printf("\nI win!!!\n");
353 1.1 cgd if (nrandom(1024) == 0723)
354 1.1 cgd (void)printf("Hah! Stupid peasant!\n");
355 1.1 cgd } else
356 1.1 cgd (void)printf("\nTie!\n");
357 1.1 cgd exit(0);
358 1.1 cgd }
359 1.1 cgd
360 1.4 lukem void
361 1.1 cgd printplayer(player)
362 1.1 cgd int player;
363 1.1 cgd {
364 1.1 cgd switch (player) {
365 1.1 cgd case COMPUTER:
366 1.1 cgd (void)printf("I ");
367 1.1 cgd break;
368 1.1 cgd case USER:
369 1.1 cgd (void)printf("You ");
370 1.1 cgd break;
371 1.1 cgd }
372 1.1 cgd }
373 1.1 cgd
374 1.4 lukem void
375 1.1 cgd printhand(hand)
376 1.9 jsm const int *hand;
377 1.1 cgd {
378 1.4 lukem int book, i, j;
379 1.1 cgd
380 1.1 cgd for (book = i = 0; i < RANKS; i++)
381 1.1 cgd if (hand[i] < CARDS)
382 1.1 cgd for (j = hand[i]; --j >= 0;)
383 1.1 cgd PRC(i);
384 1.1 cgd else
385 1.1 cgd ++book;
386 1.1 cgd if (book) {
387 1.1 cgd (void)printf(" + Book%s of", book > 1 ? "s" : "");
388 1.1 cgd for (i = 0; i < RANKS; i++)
389 1.1 cgd if (hand[i] == CARDS)
390 1.1 cgd PRC(i);
391 1.1 cgd }
392 1.1 cgd (void)putchar('\n');
393 1.1 cgd }
394 1.1 cgd
395 1.4 lukem int
396 1.1 cgd countcards(hand)
397 1.9 jsm const int *hand;
398 1.1 cgd {
399 1.4 lukem int i, count;
400 1.1 cgd
401 1.1 cgd for (count = i = 0; i < RANKS; i++)
402 1.1 cgd count += *hand++;
403 1.1 cgd return(count);
404 1.1 cgd }
405 1.1 cgd
406 1.4 lukem int
407 1.1 cgd countbooks(hand)
408 1.9 jsm const int *hand;
409 1.1 cgd {
410 1.1 cgd int i, count;
411 1.1 cgd
412 1.1 cgd for (count = i = 0; i < RANKS; i++)
413 1.1 cgd if (hand[i] == CARDS) {
414 1.1 cgd ++count;
415 1.1 cgd PRC(i);
416 1.1 cgd }
417 1.1 cgd if (!count)
418 1.1 cgd (void)printf(" none");
419 1.1 cgd (void)putchar('\n');
420 1.1 cgd return(count);
421 1.1 cgd }
422 1.1 cgd
423 1.4 lukem void
424 1.1 cgd init()
425 1.1 cgd {
426 1.12 tron int i, j, temp;
427 1.1 cgd
428 1.12 tron for (i = 0; i < TOTCARDS; ++i)
429 1.12 tron deck[i] = i % RANKS;
430 1.12 tron for (i = 0; i < TOTCARDS - 1; ++i) {
431 1.12 tron j = nrandom(TOTCARDS-i);
432 1.12 tron if (j == 0)
433 1.12 tron continue;
434 1.12 tron temp = deck[i];
435 1.12 tron deck[i] = deck[i+j];
436 1.12 tron deck[i+j] = temp;
437 1.1 cgd }
438 1.1 cgd for (i = 0; i < HANDSIZE; ++i) {
439 1.12 tron ++userhand[deck[--curcard]];
440 1.12 tron ++comphand[deck[--curcard]];
441 1.1 cgd }
442 1.1 cgd }
443 1.1 cgd
444 1.4 lukem int
445 1.1 cgd nrandom(n)
446 1.1 cgd int n;
447 1.1 cgd {
448 1.1 cgd
449 1.1 cgd return((int)random() % n);
450 1.1 cgd }
451 1.1 cgd
452 1.4 lukem void
453 1.1 cgd instructions()
454 1.1 cgd {
455 1.1 cgd int input;
456 1.5 christos pid_t pid;
457 1.8 hubertf int fd;
458 1.8 hubertf const char *pager;
459 1.5 christos int status;
460 1.1 cgd
461 1.1 cgd (void)printf("Would you like instructions (y or n)? ");
462 1.1 cgd input = getchar();
463 1.1 cgd while (getchar() != '\n');
464 1.1 cgd if (input != 'y')
465 1.1 cgd return;
466 1.1 cgd
467 1.5 christos switch (pid = fork()) {
468 1.5 christos case 0: /* child */
469 1.8 hubertf if (!isatty(1))
470 1.8 hubertf pager = "cat";
471 1.8 hubertf else {
472 1.8 hubertf if (!(pager = getenv("PAGER")) || (*pager == 0))
473 1.8 hubertf pager = _PATH_MORE;
474 1.8 hubertf }
475 1.8 hubertf if ((fd = open(_PATH_INSTR, O_RDONLY)) == -1)
476 1.8 hubertf err(1, "open %s", _PATH_INSTR);
477 1.8 hubertf if (dup2(fd, 0) == -1)
478 1.8 hubertf err(1, "dup2");
479 1.8 hubertf (void)execl("/bin/sh", "sh", "-c", pager, NULL);
480 1.8 hubertf err(1, "exec sh -c %s", pager);
481 1.5 christos /*NOTREACHED*/
482 1.5 christos case -1:
483 1.5 christos err(1, "fork");
484 1.5 christos /*NOTREACHED*/
485 1.5 christos default:
486 1.5 christos (void)waitpid(pid, &status, 0);
487 1.5 christos break;
488 1.5 christos }
489 1.1 cgd (void)printf("Hit return to continue...\n");
490 1.1 cgd while ((input = getchar()) != EOF && input != '\n');
491 1.1 cgd }
492 1.1 cgd
493 1.4 lukem void
494 1.1 cgd usage()
495 1.1 cgd {
496 1.1 cgd (void)fprintf(stderr, "usage: fish [-p]\n");
497 1.1 cgd exit(1);
498 1.1 cgd }
499