2 * Copyright (c) 1980, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 static char sccsid[] = "@(#)score.c 8.1 (Berkeley) 5/31/93";
38 static const char rcsid[] =
39 "$FreeBSD: src/games/cribbage/score.c,v 1.6 1999/11/30 03:48:47 billf Exp $";
51 * the following arrays give the sum of the scores of the (50 2)*48 = 58800
52 * hands obtainable for the crib given the two cards whose ranks index the
53 * array. the two arrays are for the case where the suits are equal and
54 * not equal respectively
57 -10000, 271827, 278883, 332319, 347769, 261129, 250653, 253203, 248259,
58 243435, 256275, 237435, 231051, -10000, -10000, 412815, 295707, 349497,
59 267519, 262521, 259695, 254019, 250047, 262887, 244047, 237663, -10000,
60 -10000, -10000, 333987, 388629, 262017, 266787, 262971, 252729, 254475,
61 267315, 248475, 242091, -10000, -10000, -10000, -10000, 422097, 302787,
62 256437, 263751, 257883, 254271, 267111, 248271, 241887, -10000, -10000,
63 -10000, -10000, -10000, 427677, 387837, 349173, 347985, 423861, 436701,
64 417861, 411477, -10000, -10000, -10000, -10000, -10000, -10000, 336387,
65 298851, 338667, 236487, 249327, 230487, 224103, -10000, -10000, -10000,
66 -10000, -10000, -10000, -10000, 408483, 266691, 229803, 246195, 227355,
67 220971, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000,
68 300675, 263787, 241695, 226407, 220023, -10000, -10000, -10000, -10000,
69 -10000, -10000, -10000, -10000, -10000, 295635, 273543, 219771, 216939,
70 -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000,
71 -10000, 306519, 252747, 211431, -10000, -10000, -10000, -10000, -10000,
72 -10000, -10000, -10000, -10000, -10000, -10000, 304287, 262971, -10000,
73 -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000,
74 -10000, -10000, 244131, -10000, -10000, -10000, -10000, -10000, -10000,
75 -10000, -10000, -10000, -10000, -10000, -10000, -10000
78 long crbnescr[169] = {
79 325272, 260772, 267828, 321264, 336714, 250074, 239598, 242148, 237204,
80 232380, 246348, 226380, 219996, -10000, 342528, 401760, 284652, 338442,
81 256464, 251466, 248640, 242964, 238992, 252960, 232992, 226608, -10000,
82 -10000, 362280, 322932, 377574, 250962, 255732, 251916, 241674, 243420,
83 257388, 237420, 231036, -10000, -10000, -10000, 360768, 411042, 291732,
84 245382, 252696, 246828, 243216, 257184, 237216, 230832, -10000, -10000,
85 -10000, -10000, 528768, 416622, 376782, 338118, 336930, 412806, 426774,
86 406806, 400422, -10000, -10000, -10000, -10000, -10000, 369864, 325332,
87 287796, 327612, 225432, 239400, 219432, 213048, -10000, -10000, -10000,
88 -10000, -10000, -10000, 359160, 397428, 255636, 218748, 236268, 216300,
89 209916, -10000, -10000, -10000, -10000, -10000, -10000, -10000, 331320,
90 289620, 252732, 231768, 215352, 208968, -10000, -10000, -10000, -10000,
91 -10000, -10000, -10000, -10000, 325152, 284580, 263616, 208716, 205884,
92 -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000,
93 321240, 296592, 241692, 200376, -10000, -10000, -10000, -10000, -10000,
94 -10000, -10000, -10000, -10000, -10000, 348600, 294360, 253044, -10000,
95 -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000,
96 -10000, 308664, 233076, -10000, -10000, -10000, -10000, -10000, -10000,
97 -10000, -10000, -10000, -10000, -10000, -10000, 295896
100 static int ichoose2[5] = { 0, 0, 2, 6, 12 };
101 static int pairpoints, runpoints; /* Globals from pairuns. */
105 * Score the given hand of n cards and the starter card.
109 scorehand(hand, starter, n, crb, do_explain)
113 BOOLEAN crb; /* true if scoring crib */
114 BOOLEAN do_explain; /* true if must explain this hand */
119 CARD h[(CINHAND + 1)];
122 expl[0] = '\0'; /* initialize explanation */
126 for (i = 0; i < n; i++) { /* check for flush */
127 flag = (flag && (hand[i].suit == k));
128 if (hand[i].rank == JACK) /* check for his nibs */
129 if (hand[i].suit == starter.suit) {
132 strcat(expl, "His Nobs");
137 if (flag && n >= CINHAND) {
138 if (do_explain && expl[0] != '\0')
140 if (starter.suit == k) {
143 strcat(expl, "Five-flush");
147 if (do_explain && expl[0] != '\0')
148 strcat(expl, ", Four-flush");
150 strcpy(expl, "Four-flush");
153 if (do_explain && expl[0] != '\0')
156 sorthand(h, n + 1); /* sort by rank */
157 i = 2 * fifteens(h, n + 1);
161 (void) sprintf(buf, "%d points in fifteens", i);
164 strcat(expl, "No fifteens");
166 i = pairuns(h, n + 1);
170 (void) sprintf(buf, ", %d points in pairs, %d in runs",
171 pairpoints, runpoints);
174 strcat(expl, ", No pairs/runs");
181 * Return number of fifteens in hand of n cards
191 static int sums[15], nsums[15];
200 for (endp = &hand[n]; hand < endp; hand++) {
205 np[-1]++; /* one way to make this */
221 * pairuns returns the number of points in the n card sorted hand
222 * due to pairs and runs
223 * this routine only works if n is strictly less than 6
224 * sets the globals pairpoints and runpoints appropriately
232 int runlength, runmult, lastmult, curmult;
233 int mult1, mult2, pair1, pair2;
242 curmult = runmult = 1;
243 for (i = 1; i < n; i++) {
245 if (h[i].rank == h[i - 1].rank) {
250 if (h[i].rank == pair1) {
261 if (i == (n - 1) && run) {
266 if (h[i].rank == h[i - 1].rank + 1) {
270 /* only if old short */
286 pairpoints = ichoose2[mult1] + ichoose2[mult2];
287 runpoints = (runlength >= 3 ? runlength * runmult : 0);
288 return (pairpoints + runpoints);
292 * pegscore tells how many points crd would get if played after
293 * the n cards in tbl during pegging
296 pegscore(crd, tbl, n, sum)
304 sum += VAL(crd.rank);
307 if (sum == 31 || sum == 15)
314 while ((crd.rank == tbl[n - j].rank) && (n - j >= 0))
317 return (scr + ichoose2[j]);
321 for (i = 0; i < RANKS; i++)
323 got[crd.rank] = TRUE;
325 for (i = n - 1; i >= 0; --i) {
326 if (got[tbl[i].rank])
328 got[tbl[i].rank] = TRUE;
329 if (tbl[i].rank < lo)
331 if (tbl[i].rank > hi)
333 for (j = lo; j <= hi; j++)
346 * adjust takes a two card hand that will be put in the crib
347 * and returns an adjusted normalized score for the number of
348 * points such a crib will get.
364 if (cb[0].suit != cb[1].suit)
365 scr = crbnescr[RANKS * c0 + c1];
367 scr = crbescr[RANKS * c0 + c1];
369 printf("\nADJUST: internal error %d %d\n", c0, c1);
372 return ((scr + 29400) / 58800);