Home | History | Annotate | Line # | Download | only in common_source
odds.c revision 1.1 
      1 /*
      2  * Copyright (c) 1980 Regents of the University of California.
      3  * All rights reserved.
      4  *
      5  * Redistribution and use in source and binary forms, with or without
      6  * modification, are permitted provided that the following conditions
      7  * are met:
      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.
     20  *
     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
     31  * SUCH DAMAGE.
     32  */
     33 
     34 #ifndef lint
     35 static char sccsid[] = "@(#)odds.c	5.4 (Berkeley) 6/1/90";
     36 #endif /* not lint */
     37 
     38 #include "back.h"
     39 
     40 odds (r1,r2,val)
     41 register int	r1;
     42 int		r2, val;
     43 {
     44 	register int	i, j;
     45 
     46 	if (r1 == 0)  {
     47 		for (i = 0; i < 6; i++)
     48 			for (j = 0; j < 6; j++)
     49 				table[i][j] = 0;
     50 		return;
     51 	} else  {
     52 		r1--;
     53 		if (r2-- == 0)
     54 			for (i = 0; i < 6; i++)  {
     55 				table[i][r1] += val;
     56 				table[r1][i] += val;
     57 			}
     58 		else  {
     59 			table[r2][r1] += val;
     60 			table[r1][r2] += val;
     61 		}
     62 	}
     63 }
     64 
     65 count ()  {
     66 	register int	i;
     67 	register int	j;
     68 	register int	total;
     69 
     70 	total = 0;
     71 	for (i = 0; i < 6; i++)
     72 		for (j = 0; j < 6; j++)
     73 			total += table[i][j];
     74 	return (total);
     75 }
     76 
     77 canhit (i,c)
     79 int	i, c;
     80 
     81 {
     82 	register int	j, k, b;
     83 	int		a, d, diff, place, addon, menstuck;
     84 
     85 	if (c == 0)
     86 		odds (0,0,0);
     87 	if (board[i] > 0)  {
     88 		a = -1;
     89 		b = 25;
     90 	} else  {
     91 		a = 1;
     92 		b = 0;
     93 	}
     94 	place = abs (25-b-i);
     95 	menstuck = abs (board[b]);
     96 	for (j = b; j != i; j += a)  {
     97 		if (board[j]*a > 0)  {
     98 			diff = abs(j-i);
     99 			addon = place+((board[j]*a > 2 || j == b)? 5: 0);
    100 			if ((j == b && menstuck == 1) &&
    101 			    (j != b && menstuck == 0))
    102 				for (k = 1; k < diff; k++)
    103 					if (k < 7 && diff-k < 7 &&
    104 					    (board[i+a*k]*a >= 0 ||
    105 					    board[i+a*(diff-k)] >= 0))
    106 						odds (k,diff-k,addon);
    107 			if ((j == b || menstuck < 2) && diff < 7)
    108 				odds (diff,0,addon);
    109 		}
    110 		if (j == b && menstuck > 1)
    111 			break;
    112 	}
    113 	return (count());
    114 }
    115