odds.c revision 1.4 1 1.4 lukem /* $NetBSD: odds.c,v 1.4 1997/10/10 08:59:46 lukem Exp $ */
2 1.3 cgd
3 1.1 cgd /*
4 1.3 cgd * Copyright (c) 1980, 1993
5 1.3 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.4 lukem #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.3 cgd #if 0
39 1.3 cgd static char sccsid[] = "@(#)odds.c 8.1 (Berkeley) 5/31/93";
40 1.3 cgd #else
41 1.4 lukem __RCSID("$NetBSD: odds.c,v 1.4 1997/10/10 08:59:46 lukem Exp $");
42 1.3 cgd #endif
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.1 cgd #include "back.h"
46 1.1 cgd
47 1.4 lukem void
48 1.4 lukem odds(r1, r2, val)
49 1.4 lukem int r1, r2, val;
50 1.1 cgd {
51 1.4 lukem int i, j;
52 1.1 cgd
53 1.4 lukem if (r1 == 0) {
54 1.4 lukem for (i = 0; i < 6; i++)
55 1.1 cgd for (j = 0; j < 6; j++)
56 1.1 cgd table[i][j] = 0;
57 1.1 cgd return;
58 1.4 lukem } else {
59 1.1 cgd r1--;
60 1.4 lukem if (r2-- == 0) {
61 1.4 lukem for (i = 0; i < 6; i++) {
62 1.1 cgd table[i][r1] += val;
63 1.1 cgd table[r1][i] += val;
64 1.1 cgd }
65 1.4 lukem } else {
66 1.1 cgd table[r2][r1] += val;
67 1.1 cgd table[r1][r2] += val;
68 1.1 cgd }
69 1.1 cgd }
70 1.1 cgd }
71 1.1 cgd
72 1.4 lukem int
73 1.4 lukem count()
74 1.4 lukem {
75 1.4 lukem int i;
76 1.4 lukem int j;
77 1.4 lukem int total;
78 1.1 cgd
79 1.1 cgd total = 0;
80 1.1 cgd for (i = 0; i < 6; i++)
81 1.1 cgd for (j = 0; j < 6; j++)
82 1.1 cgd total += table[i][j];
83 1.1 cgd return (total);
84 1.1 cgd }
85 1.1 cgd
86 1.4 lukem int
87 1.4 lukem canhit(i, c)
88 1.4 lukem int i, c;
89 1.1 cgd {
90 1.4 lukem int j, k, b;
91 1.4 lukem int a, diff, place, addon, menstuck;
92 1.1 cgd
93 1.1 cgd if (c == 0)
94 1.4 lukem odds(0, 0, 0);
95 1.4 lukem if (board[i] > 0) {
96 1.1 cgd a = -1;
97 1.1 cgd b = 25;
98 1.4 lukem } else {
99 1.1 cgd a = 1;
100 1.1 cgd b = 0;
101 1.1 cgd }
102 1.4 lukem place = abs(25 - b - i);
103 1.4 lukem menstuck = abs(board[b]);
104 1.4 lukem for (j = b; j != i; j += a) {
105 1.4 lukem if (board[j] * a > 0) {
106 1.4 lukem diff = abs(j - i);
107 1.4 lukem addon = place + ((board[j] * a > 2 || j == b) ? 5 : 0);
108 1.1 cgd if ((j == b && menstuck == 1) &&
109 1.1 cgd (j != b && menstuck == 0))
110 1.1 cgd for (k = 1; k < diff; k++)
111 1.4 lukem if (k < 7 && diff - k < 7 &&
112 1.4 lukem (board[i + a * k] * a >= 0 ||
113 1.4 lukem board[i + a * (diff - k)] >= 0))
114 1.4 lukem odds(k, diff - k, addon);
115 1.1 cgd if ((j == b || menstuck < 2) && diff < 7)
116 1.4 lukem odds(diff, 0, addon);
117 1.1 cgd }
118 1.1 cgd if (j == b && menstuck > 1)
119 1.1 cgd break;
120 1.1 cgd }
121 1.1 cgd return (count());
122 1.1 cgd }
123