\n
![\"go\"](\"http:\/\/upload.wikimedia.org\/wikipedia\/en\/2\/2e\/Go_board.jpg\")
<\/p>\nGo is a traditional Chinese game.<\/p>\n
Rule: Players place alternately black and white stones on the vacant intersections of a 19\u00d719 rectilinear grid. A stone is captured and removed if it is tightly surrounded by stones of the opposing color. The objective is to control a larger territory than the opponent by placing one’s stones so they cannot be captured, but can capture any opposing stones played in one’s territory. The game ends and the score is counted when both players consecutively pass on a turn, indicating that neither side can increase its territory or reduce its opponent’s; the game can also end by resignation.
\n<\/p>\n
Just for info:<\/p>\n
It is commonly said that no Go game has ever been played twice. Calculations suggest this may be true: on a 19\u00d719 board, there are about 3361<\/sup>\u00d70.012 = 2.1\u00d710170<\/sup> possible positions, most of which are the end result of about (120!)2<\/sup> = 4.5\u00d710397<\/sup> different (no-capture) games, for a total of about 9.3\u00d710567<\/sup> games. Allowing captures gives as many as<\/p>\n possible games, all of which last for over 4.1\u00d71048<\/sup> moves.<\/p>\n In comparison, the number of legal positions in chess is estimated to be between 1043<\/sup> and 1050<\/sup>.<\/p>\n","protected":false},"excerpt":{"rendered":" Go is a traditional Chinese game. Rule: Players place alternately black and white stones on the vacant intersections of a 19\u00d719 rectilinear grid. A stone is captured and removed if it is tightly surrounded by stones of the opposing color. … Continue reading \n
![\"10^{7.49](\"http:\/\/upload.wikimedia.org\/math\/9\/6\/f\/96f79e80bf8154d8b8a9ea207148a0e9.png\")
<\/dd>\n<\/dl>\n