odds.c revision 1.3 1 1.3 cgd /* $NetBSD: odds.c,v 1.3 1995/03/21 15:05:47 cgd 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.1 cgd #ifndef lint
37 1.3 cgd #if 0
38 1.3 cgd static char sccsid[] = "@(#)odds.c 8.1 (Berkeley) 5/31/93";
39 1.3 cgd #else
40 1.3 cgd static char rcsid[] = "$NetBSD: odds.c,v 1.3 1995/03/21 15:05:47 cgd Exp $";
41 1.3 cgd #endif
42 1.1 cgd #endif /* not lint */
43 1.1 cgd
44 1.1 cgd #include "back.h"
45 1.1 cgd
46 1.1 cgd odds (r1,r2,val)
47 1.1 cgd register int r1;
48 1.1 cgd int r2, val;
49 1.1 cgd {
50 1.1 cgd register int i, j;
51 1.1 cgd
52 1.1 cgd if (r1 == 0) {
53 1.1 cgd for (i = 0; i < 6; i++)
54 1.1 cgd for (j = 0; j < 6; j++)
55 1.1 cgd table[i][j] = 0;
56 1.1 cgd return;
57 1.1 cgd } else {
58 1.1 cgd r1--;
59 1.1 cgd if (r2-- == 0)
60 1.1 cgd for (i = 0; i < 6; i++) {
61 1.1 cgd table[i][r1] += val;
62 1.1 cgd table[r1][i] += val;
63 1.1 cgd }
64 1.1 cgd else {
65 1.1 cgd table[r2][r1] += val;
66 1.1 cgd table[r1][r2] += val;
67 1.1 cgd }
68 1.1 cgd }
69 1.1 cgd }
70 1.1 cgd
71 1.1 cgd count () {
72 1.1 cgd register int i;
73 1.1 cgd register int j;
74 1.1 cgd register int total;
75 1.1 cgd
76 1.1 cgd total = 0;
77 1.1 cgd for (i = 0; i < 6; i++)
78 1.1 cgd for (j = 0; j < 6; j++)
79 1.1 cgd total += table[i][j];
80 1.1 cgd return (total);
81 1.1 cgd }
82 1.1 cgd
83 1.1 cgd canhit (i,c)
85 1.1 cgd int i, c;
86 1.1 cgd
87 1.1 cgd {
88 1.1 cgd register int j, k, b;
89 1.1 cgd int a, d, diff, place, addon, menstuck;
90 1.1 cgd
91 1.1 cgd if (c == 0)
92 1.1 cgd odds (0,0,0);
93 1.1 cgd if (board[i] > 0) {
94 1.1 cgd a = -1;
95 1.1 cgd b = 25;
96 1.1 cgd } else {
97 1.1 cgd a = 1;
98 1.1 cgd b = 0;
99 1.1 cgd }
100 1.1 cgd place = abs (25-b-i);
101 1.1 cgd menstuck = abs (board[b]);
102 1.1 cgd for (j = b; j != i; j += a) {
103 1.1 cgd if (board[j]*a > 0) {
104 1.1 cgd diff = abs(j-i);
105 1.1 cgd addon = place+((board[j]*a > 2 || j == b)? 5: 0);
106 1.1 cgd if ((j == b && menstuck == 1) &&
107 1.1 cgd (j != b && menstuck == 0))
108 1.1 cgd for (k = 1; k < diff; k++)
109 1.1 cgd if (k < 7 && diff-k < 7 &&
110 1.1 cgd (board[i+a*k]*a >= 0 ||
111 1.1 cgd board[i+a*(diff-k)] >= 0))
112 1.1 cgd odds (k,diff-k,addon);
113 1.1 cgd if ((j == b || menstuck < 2) && diff < 7)
114 1.1 cgd odds (diff,0,addon);
115 1.1 cgd }
116 1.1 cgd if (j == b && menstuck > 1)
117 1.1 cgd break;
118 1.1 cgd }
119 1.1 cgd return (count());
120 }
121