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
33 * @(#)one.c 8.1 (Berkeley) 5/31/93
34 * $FreeBSD: src/games/backgammon/common_source/one.c,v 1.5 1999/11/30 03:48:27 billf Exp $
35 * $DragonFly: src/games/backgammon/common_source/one.c,v 1.3 2006/08/08 16:36:11 pavalos Exp $
40 static int checkd(int);
41 static int last(void);
51 max
= (*offptr
< 0? 7: last());
52 if (board
[p
[i
]]*cturn
<= 0)
54 if (g
[i
] != home
&& board
[g
[i
]]*cturn
< -1)
57 if (n
== max
? D1
< n
: D1
!= n
)
60 if (n
== max
? D0
< n
&& D1
< n
: D0
!= n
&& D1
!= n
)
62 if (n
== max
? D0
< n
: D0
!= n
) {
68 if (g
[i
] == home
&& *offptr
< 0)
73 if (board
[g
[i
]] == -cturn
) {
77 if (abs(bar
-g
[i
]) < 7) {
84 if (abs(home
-g
[i
]) < 7 && abs(home
-p
[i
]) > 6) {
86 if (*inptr
+*offptr
== 0)
106 for (j
= 0; j
<= i
; j
++) {
130 for (i
= home
-6*cturn
; i
!= home
; i
+= cturn
)
131 if (board
[i
]*cturn
> 0)
132 return (abs(home
-i
));
141 for (j
= i
-1; j
>= 0; j
--)
148 board
[p
[i
]] += cturn
;
150 board
[g
[i
]] -= cturn
;
151 if (abs(g
[i
]-home
) < 7 && abs(p
[i
]-home
) > 6) {
153 if (*inptr
+*offptr
< 15 && *offptr
>= 0)
161 board
[home
] += cturn
;
162 board
[g
[i
]] = -cturn
;
163 if (abs(bar
-g
[i
]) < 7) {
165 if (*inopp
+*offopp
== 0)