The Logical Rules

Go is played on a 19x19 square grid of points, by two players called Black and White.
Each point on the grid may be colored black, white or empty.
A point P, not colored C, is said to reach C, if there is a path of (vertically or horizontally)
adjacent points of P's color from P to a point of color C.
Clearing a color is the process of emptying all points of that color that don't reach empty.
Starting with an empty grid, the players alternate turns, starting with Black.
A turn is either a pass; or a move that doesn't repeat an earlier grid coloring.
A move consists of coloring an empty point one's own color;
then clearing the opponent color, and then clearing one's own color.
The game ends after two consecutive passes.
A player's score is the number of points of her color, plus the number of empty points that reach only her color.
The player with the higher score at the end of the game is the winner. Equal scores result in a tie.    

原出处:http://tromp.github.io/go.html
有haskell的实现: http://tromp.github.io/go/SimpleGo.hs.txt
中文翻译:https://tieba.baidu.com/p/5437396471 Tromp-Taylor 规则:

1、围棋在19x19的棋盘上进行,对战者称为黑方和白方;
2、每个交叉点为黑,白,空三种颜色;
3、称某颜色不为C的点P为“到达C”,若存在一条由全是P点颜色的相邻点(水平或竖直)构成的从P到某颜色为C的点的路径;(就是说从P可以一直不变色地走到一个颜色为C的点)
4、将所有不能“到达空”的某种颜色的点染为空,叫做“清除”那种颜色;
5、从空白棋盘开始,双方轮替“下”,黑方起始;
6、“下”要么是什么也不走,要么是使得全局不和以往重复的一次“落子”;
7、“落子”由如下步骤组成:首先将一个空点染为己方颜色,然后“清除”对方颜色,再然后“清除”己方颜色;
8、当出现两次连续的“不走”时,棋局结束;
9、某一方的点数等于此方颜色的点数加上只“到达”这一颜色的空色点数;
10、点数高的一方获胜。双方点数相等为平局。
这一规则由 John Tromp 和 Bill Taylor 创制,也被称为围棋的逻辑规则,试图尽量简化规则,并消除歧义。