1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
|
/*
GNUGO - the game of Go (Wei-Chi)
Version 1.2 last revised 10-31-95
Copyright (C) Free Software Foundation, Inc.
written by Man L. Li
modified by Wayne Iba
modified by Frank Pursel <fpp%minor.UUCP@dragon.com>
documented by Bob Webber
*/
/*
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation - version 2.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License in file COPYING for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
Please report any bug/fix, modification, suggestion to
manli@cs.uh.edu
*/
/*----------------------------------------------
fioe.c -- Check if current location is own eye
----------------------------------------------*/
#include "gnugo.h"
extern unsigned char p[19][19]; /* go board */
extern int mymove; /* computer color */
int fioe(int i, /* stone row number 0 to 18 */
int j) /* stone column number 0 to 18 */
{
/* check top edge */
if (i == 0)
{
if ((j == 0) && ((p[1][0] == mymove) && (p[0][1] == mymove))) return 1;
if ((j == 18) && ((p[1][18] == mymove) && (p[0][17] == mymove))) return 1;
if ((p[1][j] == mymove) &&
((p[0][j - 1] == mymove) && (p[0][j + 1] == mymove))) return 1;
else
return 0;
}
/* check bottom edge */
if (i == 18)
{
if ((j == 0) && ((p[17][0] == mymove) && (p[18][1] == mymove))) return 1;
if ((j == 18) && ((p[17][18] == mymove) && (p[18][17] == mymove))) return 1;
if ((p[17][j] == mymove) &&
((p[18][j - 1] == mymove) && (p[18][j + 1] == mymove)))
return 1;
else
return 0;
}
/* check left edge */
if (j == 0)
if ((p[i][1] == mymove) &&
((p[i - 1] [0] == mymove) && (p[i + 1][0] == mymove)))
return 1;
else
return 0;
/* check right edge */
if (j == 18)
if ((p[i][17] == mymove) &&
((p[i - 1] [18] == mymove) && (p[i + 1][18] == mymove)))
return 1;
else
return 0;
/* check center pieces */
if (((p[i][j - 1] == mymove) && (p[i][j + 1] == mymove)) &&
((p[i - 1][j] == mymove) && (p[i + 1][j] == mymove)))
return 1;
else
return 0;
} /* fioe */
|
