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