/* GNU GO - the game of Go (Wei-Chi) Version 1.1 last revised 3-1-89 Copyright (C) Free Software Foundation, Inc. written by Man L. Li modified by Wayne Iba documented by Bob Webber NeXT version by John Neil */ /* 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 1. 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 mail address: Man L. Li Dept. of Computer Science University of Houston 4800 Calhoun Road Houston, TX 77004 e-mail address: manli@cs.uh.edu (Internet) coscgbn@uhvax1.bitnet (BITNET) 70070,404 (CompuServe) For the NeXT version, please report any bug/fix, modification, suggestion to mail address: John Neil Mathematics Department Portland State University PO Box 751 Portland, OR 97207 e-mail address: neil@math.mth.pdx.edu (Internet) neil@psuorvm.bitnet (BITNET) */ #include "comment.header" /* $Id: count.c,v 1.1 2003/01/12 04:01:52 gcasa Exp $ */ /* * $Log: count.c,v $ * Revision 1.1 2003/01/12 04:01:52 gcasa * Committing the entire GNU Go and NeXT Go application to the repository. * See COPYING file for GNU License. * * Revision 1.3 1997/07/06 19:34:52 ergo * actual version * * Revision 1.2 1997/05/04 18:56:58 ergo * added time control for moves * */ #define EMPTY 0 extern unsigned char p[19][19], ml[19][19]; extern int lib, MAXX, MAXY; void count(int i, int j, int color) /* count liberty of color piece at i, j */ { /* set current piece as marked */ ml[i][j] = EMPTY; /* check North neighbor */ if (i != EMPTY) { if ((p[i - 1][j] == EMPTY) && ml[i - 1][j]) { ++lib; ml[i - 1][j] = EMPTY; } else if ((p[i - 1][j] == color) && ml[i - 1][j]) count(i - 1, j, color); } /* check South neighbor */ if (i != MAXX - 1) { if ((p[i + 1][j] == EMPTY) && ml[i + 1][j]) { ++lib; ml[i + 1][j] = EMPTY; } else if ((p[i + 1][j] == color) && ml[i + 1][j]) count(i + 1, j, color); } /* check West neighbor */ if (j != EMPTY) { if ((p[i][j - 1] == EMPTY) && ml[i][j - 1]) { ++lib; ml[i][j - 1] = EMPTY; } else if ((p[i][j - 1] == color) && ml[i][j - 1]) count(i, j - 1, color); } /* check East neighbor */ if (j != MAXY - 1) { if ((p[i][j + 1] == EMPTY) && ml[i][j + 1]) { ++lib; ml[i][j + 1] = EMPTY; } else if ((p[i][j + 1] == color) && ml[i][j + 1]) count(i, j + 1, color); } } /* end count */