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. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * @(#)one.c 8.1 (Berkeley) 5/31/93
30 * $FreeBSD: src/games/backgammon/common_source/one.c,v 1.5 1999/11/30 03:48:27 billf Exp $
31 * $DragonFly: src/games/backgammon/common_source/one.c,v 1.3 2006/08/08 16:36:11 pavalos Exp $
36 static int checkd(int);
37 static int last(void);
47 max = (*offptr < 0 ? 7 : last());
48 if (board[p[i]] * cturn <= 0)
49 return (checkd(d) + 2);
50 if (g[i] != home && board[g[i]] * cturn < -1)
51 return (checkd(d) + 3);
53 if (n == max ? D1 < n : D1 != n)
54 return (checkd(d) + 1);
56 if (n == max ? D0 < n && D1 < n : D0 != n && D1 != n)
57 return (checkd(d) + 1);
58 if (n == max ? D0 < n : D0 != n) {
60 return (checkd(d) + 1);
64 if (g[i] == home && *offptr < 0)
65 return (checkd(d) + 4);
69 if (board[g[i]] == -cturn) {
73 if (abs(bar - g[i]) < 7) {
80 if (abs(home - g[i]) < 7 && abs(home - p[i]) > 6) {
82 if (*inptr + *offptr == 0)
102 for (j = 0; j <= i; j++) {
126 for (i = home - 6 * cturn; i != home; i += cturn)
127 if (board[i] * cturn > 0)
128 return (abs(home - i));
137 for (j = i - 1; j >= 0; j--)
144 board[p[i]] += cturn;
146 board[g[i]] -= cturn;
147 if (abs(g[i] - home) < 7 && abs(p[i] - home) > 6) {
149 if (*inptr + *offptr < 15 && *offptr >= 0)
157 board[home] += cturn;
158 board[g[i]] = -cturn;
159 if (abs(bar - g[i]) < 7) {
161 if (*inopp + *offopp == 0)