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[] = "@(#)support.c 8.1 (Berkeley) 5/31/93";
38 static const char rcsid[] =
49 #define NTV 10 /* number scores to test */
51 /* score to test reachability of, and order to test them in */
52 int tv[NTV] = {8, 7, 9, 6, 11, 12, 13, 14, 10, 5};
55 * computer chooses what to play in pegging...
56 * only called if no playable card will score points
67 if (s < 4) { /* try for good value */
68 if ((j = anysumto(h, n, s, 4)) >= 0)
70 if ((j = anysumto(h, n, s, 3)) >= 0 && s == 0)
73 if (s > 0 && s < 20) {
74 /* try for retaliation to 31 */
75 for (i = 1; i <= 10; i++) {
76 if ((j = anysumto(h, n, s, 21 - i)) >= 0) {
77 if ((l = numofval(h, n, i)) > 0) {
78 if (l > 1 || VAL(h[j].rank) != i)
85 /* for retaliation after 15 */
86 for (i = 0; i < NTV; i++) {
87 if ((j = anysumto(h, n, s, tv[i])) >= 0) {
88 if ((l = numofval(h, n, 15 - tv[i])) > 0) {
90 VAL(h[j].rank) != 15 - tv[i])
97 /* remember: h is sorted */
98 for (i = n - 1; i >= 0; --i) {
99 l = s + VAL(h[i].rank);
102 if (l != 5 && l != 10 && l != 21) {
109 for (i = n - 1; i >= 0; --i) {
110 l = s + VAL(h[i].rank);
115 if (l != 5 && l != 21) {
125 * Evaluate and score a player hand or crib
132 static char prompt[BUFSIZ];
136 prhand(hand, CINHAND, Playwin, FALSE);
137 (void) sprintf(prompt, "Your %s scores ", s);
138 i = scorehand(hand, turnover, CINHAND, strcmp(s, "crib") == 0, explain);
139 if ((j = number(0, 29, prompt)) == 19)
143 win = chkscr(&pscore, i);
144 msg("It's really only %d points; I get %d", i, 2);
146 win = chkscr(&cscore, 2);
148 win = chkscr(&pscore, j);
149 msg("You should have taken %d, not %d!", i, j);
152 msg("Explanation: %s", expl);
155 win = chkscr(&pscore, i);
161 * Handle scoring and displaying the computers hand
170 j = scorehand(h, turnover, CINHAND, strcmp(s, "crib") == 0, FALSE);
171 prhand(h, CINHAND, Compwin, FALSE);
172 msg("My %s scores %d", s, (j == 0 ? 19 : j));
173 return (chkscr(&cscore, j));
178 * Add inc to scr and test for > glimit, printing on the scoring
179 * board while we're at it.
181 int Lastscore[2] = {-1, -1};
189 myturn = (scr == &cscore);
191 prpeg(Lastscore[myturn ? 1 : 0], '.', myturn);
192 Lastscore[myturn ? 1 : 0] = *scr;
194 prpeg(*scr, PEG, myturn);
197 return (*scr >= glimit);
202 * Put out the peg character on the score board and put the
203 * score up on the board.
206 prpeg(score, peg, myturn)
218 if (score <= 0 || score >= glimit) {
228 x = (score - 1) % 30;
229 if (score > 90 || (score > 30 && score <= 60)) {
237 mvprintw(SCORE_Y + (myturn ? 7 : 1), SCORE_X + 10, "%3d", score);
241 * cdiscard -- the computer figures out what is the best discard for
242 * the crib and puts the best two cards at the end
248 CARD d[CARDS], h[FULLHAND], cb[2];
252 static int undo1[15] = {0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4};
253 static int undo2[15] = {1, 2, 3, 4, 5, 2, 3, 4, 5, 3, 4, 5, 4, 5, 5};
257 for (i = 0; i < knownum; i++) { /* get all other cards */
258 cremove(known[i], d, nc--);
260 for (i = 0; i < 15; i++)
263 for (i = 0; i < (FULLHAND - 1); i++) {
265 for (j = i + 1; j < FULLHAND; j++) {
267 for (k = 0; k < FULLHAND; k++)
269 cremove(chand[i], h, FULLHAND);
270 cremove(chand[j], h, FULLHAND - 1);
271 for (k = 0; k < nc; k++) {
273 scorehand(h, d[k], CINHAND, TRUE, FALSE);
275 sums[ns] += adjust(cb, d[k]);
277 sums[ns] -= adjust(cb, d[k]);
283 for (i = 1; i < 15; i++)
284 if (sums[i] > sums[j])
286 for (k = 0; k < FULLHAND; k++)
288 cremove(h[undo1[j]], chand, FULLHAND);
289 cremove(h[undo2[j]], chand, FULLHAND - 1);
290 chand[4] = h[undo1[j]];
291 chand[5] = h[undo2[j]];
295 * returns true if some card in hand can be played without exceeding 31
298 anymove(hand, n, sum)
307 for (i = 1; i < n; i++) {
308 if (hand[i].rank < j)
311 return (sum + VAL(j) <= 31);
315 * anysumto returns the index (0 <= i < n) of the card in hand that brings
316 * the s up to t, or -1 if there is none
319 anysumto(hand, n, s, t)
325 for (i = 0; i < n; i++) {
326 if (s + VAL(hand[i].rank) == t)
333 * return the number of cards in h having the given rank value
343 for (i = 0; i < n; i++) {
344 if (VAL(h[i].rank) == v)
351 * makeknown remembers all n cards in h for future recall
360 for (i = 0; i < n; i++)
361 known[knownum++] = h[i];