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