cribbage/score.c

   1 /*      $NetBSD: score.c,v 1.11 2005/07/02 08:32:32 jmc Exp $   */
   2
   3 /*-
   4  * Copyright (c) 1980, 1993
   5  *      The Regents of the University of California.  All rights reserved.
   6  *
   7  * Redistribution and use in source and binary forms, with or without
   8  * modification, are permitted provided that the following conditions
   9  * are met:
  10  * 1. Redistributions of source code must retain the above copyright
  11  *    notice, this list of conditions and the following disclaimer.
  12  * 2. Redistributions in binary form must reproduce the above copyright
  13  *    notice, this list of conditions and the following disclaimer in the
  14  *    documentation and/or other materials provided with the distribution.
  15  * 3. Neither the name of the University nor the names of its contributors
  16  *    may be used to endorse or promote products derived from this software
  17  *    without specific prior written permission.
  18  *
  19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  29  * SUCH DAMAGE.
  30  */
  31
  32 #include <sys/cdefs.h>
  33 #ifndef lint
  34 #if 0
  35 static char sccsid[] = "@(#)score.c     8.1 (Berkeley) 5/31/93";
  36 #else
  37 __RCSID("$NetBSD: score.c,v 1.11 2005/07/02 08:32:32 jmc Exp $");
  38 #endif
  39 #endif /* not lint */
  40
  41 #include <curses.h>
  42 #include <stdio.h>
  43 #include <stdlib.h>
  44 #include <string.h>
  45
  46 #include "deck.h"
  47 #include "cribbage.h"
  48
  49 /*
  50  * the following arrays give the sum of the scores of the (50 2)*48 = 58800
  51  * hands obtainable for the crib given the two cards whose ranks index the
  52  * array.  the two arrays are for the case where the suits are equal and
  53  * not equal respectively
  54  */
  55 const long crbescr[169] = {
  56     -10000, 271827, 278883, 332319, 347769, 261129, 250653, 253203, 248259,
  57     243435, 256275, 237435, 231051, -10000, -10000, 412815, 295707, 349497,
  58     267519, 262521, 259695, 254019, 250047, 262887, 244047, 237663, -10000,
  59     -10000, -10000, 333987, 388629, 262017, 266787, 262971, 252729, 254475,
  60     267315, 248475, 242091, -10000, -10000, -10000, -10000, 422097, 302787,
  61     256437, 263751, 257883, 254271, 267111, 248271, 241887, -10000, -10000,
  62     -10000, -10000, -10000, 427677, 387837, 349173, 347985, 423861, 436701,
  63     417861, 411477, -10000, -10000, -10000, -10000, -10000, -10000, 336387,
  64     298851, 338667, 236487, 249327, 230487, 224103, -10000, -10000, -10000,
  65     -10000, -10000, -10000, -10000, 408483, 266691, 229803, 246195, 227355,
  66     220971, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000,
  67     300675, 263787, 241695, 226407, 220023, -10000, -10000, -10000, -10000,
  68     -10000, -10000, -10000, -10000, -10000, 295635, 273543, 219771, 216939,
  69     -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000,
  70     -10000, 306519, 252747, 211431, -10000, -10000, -10000, -10000, -10000,
  71     -10000, -10000, -10000, -10000, -10000, -10000, 304287, 262971, -10000,
  72     -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000,
  73     -10000, -10000, 244131, -10000, -10000, -10000, -10000, -10000, -10000,
  74     -10000, -10000, -10000, -10000, -10000, -10000, -10000
  75 };
  76
  77 const long crbnescr[169] = {
  78     325272, 260772, 267828, 321264, 336714, 250074, 239598, 242148, 237204,
  79     232380, 246348, 226380, 219996, -10000, 342528, 401760, 284652, 338442,
  80     256464, 251466, 248640, 242964, 238992, 252960, 232992, 226608, -10000,
  81     -10000, 362280, 322932, 377574, 250962, 255732, 251916, 241674, 243420,
  82     257388, 237420, 231036, -10000, -10000, -10000, 360768, 411042, 291732,
  83     245382, 252696, 246828, 243216, 257184, 237216, 230832, -10000, -10000,
  84     -10000, -10000, 528768, 416622, 376782, 338118, 336930, 412806, 426774,
  85     406806, 400422, -10000, -10000, -10000, -10000, -10000, 369864, 325332,
  86     287796, 327612, 225432, 239400, 219432, 213048, -10000, -10000, -10000,
  87     -10000, -10000, -10000, 359160, 397428, 255636, 218748, 236268, 216300,
  88     209916, -10000, -10000, -10000, -10000, -10000, -10000, -10000, 331320,
  89     289620, 252732, 231768, 215352, 208968, -10000, -10000, -10000, -10000,
  90     -10000, -10000, -10000, -10000, 325152, 284580, 263616, 208716, 205884,
  91     -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000,
  92     321240, 296592, 241692, 200376, -10000, -10000, -10000, -10000, -10000,
  93     -10000, -10000, -10000, -10000, -10000, 348600, 294360, 253044, -10000,
  94     -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000,
  95     -10000, 308664, 233076, -10000, -10000, -10000, -10000, -10000, -10000,
  96     -10000, -10000, -10000, -10000, -10000, -10000, 295896
  97 };
  98
  99 static const int ichoose2[5] = { 0, 0, 2, 6, 12 };
 100 static int pairpoints, runpoints;               /* Globals from pairuns. */
 101
 102 /*
 103  * scorehand:
 104  *      Score the given hand of n cards and the starter card.
 105  *      n must be <= 4
 106  */
 107 int
 108 scorehand(const CARD hand[], CARD starter, int n, BOOLEAN crb,
 109           BOOLEAN do_explain)
 110 {
 111         int i, k;
 112         int hscore;
 113         BOOLEAN flag;
 114         CARD h[(CINHAND + 1)];
 115         char buf[32];
 116
 117         explan[0] = '\0';       /* initialize explanation */
 118         hscore = 0;
 119         flag = TRUE;
 120         k = hand[0].suit;
 121         for (i = 0; i < n; i++) {       /* check for flush */
 122                 flag = (flag && (hand[i].suit == k));
 123                 if (hand[i].rank == JACK)       /* check for his nibs */
 124                         if (hand[i].suit == starter.suit) {
 125                                 hscore++;
 126                                 if (do_explain)
 127                                         strcat(explan, "His Nobs");
 128                         }
 129                 h[i] = hand[i];
 130         }
 131
 132         if (flag && n >= CINHAND) {
 133                 if (do_explain && explan[0] != '\0')
 134                         strcat(explan, ", ");
 135                 if (starter.suit == k) {
 136                         hscore += 5;
 137                         if (do_explain)
 138                                 strcat(explan, "Five-flush");
 139                 } else
 140                         if (!crb) {
 141                                 hscore += 4;
 142                                 if (do_explain && explan[0] != '\0')
 143                                         strcat(explan, ", Four-flush");
 144                                 else
 145                                         strcpy(explan, "Four-flush");
 146                         }
 147         }
 148         if (do_explain && explan[0] != '\0')
 149                 strcat(explan, ", ");
 150         h[n] = starter;
 151         sorthand(h, n + 1);     /* sort by rank */
 152         i = 2 * fifteens(h, n + 1);
 153         hscore += i;
 154         if (do_explain) {
 155                 if (i > 0) {
 156                         (void) sprintf(buf, "%d points in fifteens", i);
 157                         strcat(explan, buf);
 158                 } else
 159                         strcat(explan, "No fifteens");
 160         }
 161         i = pairuns(h, n + 1);
 162         hscore += i;
 163         if (do_explain) {
 164                 if (i > 0) {
 165                         (void) sprintf(buf, ", %d points in pairs, %d in runs",
 166                             pairpoints, runpoints);
 167                         strcat(explan, buf);
 168                 } else
 169                         strcat(explan, ", No pairs/runs");
 170         }
 171         return (hscore);
 172 }
 173
 174 /*
 175  * fifteens:
 176  *      Return number of fifteens in hand of n cards
 177  */
 178 int
 179 fifteens(const CARD hand[], int n)
 180 {
 181         int *sp, *np;
 182         int i;
 183         const CARD *endp;
 184         static int sums[15], nsums[15];
 185
 186         np = nsums;
 187         sp = sums;
 188         i = 16;
 189         while (--i) {
 190                 *np++ = 0;
 191                 *sp++ = 0;
 192         }
 193         for (endp = &hand[n]; hand < endp; hand++) {
 194                 i = hand->rank + 1;
 195                 if (i > 10)
 196                         i = 10;
 197                 np = &nsums[i];
 198                 np[-1]++;       /* one way to make this */
 199                 sp = sums;
 200                 while (i < 15) {
 201                         *np++ += *sp++;
 202                         i++;
 203                 }
 204                 sp = sums;
 205                 np = nsums;
 206                 i = 16;
 207                 while (--i)
 208                         *sp++ = *np++;
 209         }
 210         return sums[14];
 211 }
 212
 213 /*
 214  * pairuns returns the number of points in the n card sorted hand
 215  * due to pairs and runs
 216  * this routine only works if n is strictly less than 6
 217  * sets the globals pairpoints and runpoints appropriately
 218  */
 219 int
 220 pairuns(const CARD h[], int n)
 221 {
 222         int i;
 223         int runlength, runmult, lastmult, curmult;
 224         int mult1, mult2, pair1, pair2;
 225         BOOLEAN run;
 226
 227         run = TRUE;
 228         runlength = 1;
 229         mult1 = 1;
 230         pair1 = -1;
 231         mult2 = 1;
 232         pair2 = -1;
 233         curmult = runmult = 1;
 234         for (i = 1; i < n; i++) {
 235                 lastmult = curmult;
 236                 if (h[i].rank == h[i - 1].rank) {
 237                         if (pair1 < 0) {
 238                                 pair1 = h[i].rank;
 239                                 mult1 = curmult = 2;
 240                         } else {
 241                                 if (h[i].rank == pair1) {
 242                                         curmult = ++mult1;
 243                                 } else {
 244                                         if (pair2 < 0) {
 245                                                 pair2 = h[i].rank;
 246                                                 mult2 = curmult = 2;
 247                                         } else {
 248                                                 curmult = ++mult2;
 249                                         }
 250                                 }
 251                         }
 252                         if (i == (n - 1) && run) {
 253                                 runmult *= curmult;
 254                         }
 255                 } else {
 256                         curmult = 1;
 257                         if (h[i].rank == h[i - 1].rank + 1) {
 258                                 if (run) {
 259                                         ++runlength;
 260                                 } else {
 261                                                         /* only if old short */
 262                                         if (runlength < 3) {
 263                                                 run = TRUE;
 264                                                 runlength = 2;
 265                                                 runmult = 1;
 266                                         }
 267                                 }
 268                                 runmult *= lastmult;
 269                         } else {
 270                                                         /* if just ended */
 271                                 if (run)
 272                                         runmult *= lastmult;
 273                                 run = FALSE;
 274                         }
 275                 }
 276         }
 277         pairpoints = ichoose2[mult1] + ichoose2[mult2];
 278         runpoints = (runlength >= 3 ? runlength * runmult : 0);
 279         return (pairpoints + runpoints);
 280 }
 281
 282 /*
 283  * pegscore tells how many points crd would get if played after
 284  * the n cards in tbl during pegging
 285  */
 286 int
 287 pegscore(CARD crd, const CARD tbl[], int n, int sum)
 288 {
 289         BOOLEAN got[RANKS];
 290         int i, j, scr;
 291         int k, lo, hi;
 292
 293         sum += VAL(crd.rank);
 294         if (sum > 31)
 295                 return (-1);
 296         if (sum == 31 || sum == 15)
 297                 scr = 2;
 298         else
 299                 scr = 0;
 300         if (!n)
 301                 return (scr);
 302         j = 1;
 303         while ((crd.rank == tbl[n - j].rank) && (n - j >= 0))
 304                 ++j;
 305         if (j > 1)
 306                 return (scr + ichoose2[j]);
 307         if (n < 2)
 308                 return (scr);
 309         lo = hi = crd.rank;
 310         for (i = 0; i < RANKS; i++)
 311                 got[i] = FALSE;
 312         got[crd.rank] = TRUE;
 313         k = -1;
 314         for (i = n - 1; i >= 0; --i) {
 315                 if (got[tbl[i].rank])
 316                         break;
 317                 got[tbl[i].rank] = TRUE;
 318                 if (tbl[i].rank < lo)
 319                         lo = tbl[i].rank;
 320                 if (tbl[i].rank > hi)
 321                         hi = tbl[i].rank;
 322                 for (j = lo; j <= hi; j++)
 323                         if (!got[j])
 324                                 break;
 325                 if (j > hi)
 326                         k = hi - lo + 1;
 327         }
 328         if (k >= 3)
 329                 return (scr + k);
 330         else
 331                 return (scr);
 332 }
 333
 334 /*
 335  * adjust takes a two card hand that will be put in the crib
 336  * and returns an adjusted normalized score for the number of
 337  * points such a crib will get.
 338  */
 339 int
 340 adjust(const CARD cb[], CARD tnv __attribute((__unused__)))
 341 {
 342         long scr;
 343         int i, c0, c1;
 344
 345         c0 = cb[0].rank;
 346         c1 = cb[1].rank;
 347         if (c0 > c1) {
 348                 i = c0;
 349                 c0 = c1;
 350                 c1 = i;
 351         }
 352         if (cb[0].suit != cb[1].suit)
 353                 scr = crbnescr[RANKS * c0 + c1];
 354         else
 355                 scr = crbescr[RANKS * c0 + c1];
 356         if (scr <= 0) {
 357                 printf("\nADJUST: internal error %d %d\n", c0, c1);
 358                 exit(93);
 359         }
 360         return ((scr + 29400) / 58800);
 361 }