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