[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: computer-go: Most simple Go rules



How can there be an infinite number of positions? An upper bound on positions is 3^361 and only a small fraction of those are legal. The number of games is not infinite either since you can only be in each board position once. An upper bound on the number of games is the number of legal board positions factorial. Now thats a big number. An approximation (not upper bound) is 361 factorial.


At 05:25 PM 6/21/2001 -0400, you wrote:


On Thu, 21 Jun 2001, Xinwei Kong wrote:

> The most simple Go rules:
>
> Rule 1: never allow to repeat a previous board state unless pass
> Rule 2: both pass end the game
> Rule 3: only stones on the board counts

Obviously you must mean in addition to the rules of capture, who goes
first, suicide, etc.

>
> I think it is enough to solve all the problems(even super Ko), and
> it is more like ancient chinese rules if you play to the end. It is
> theoretically to grantee an end since there are only finite number
> of possible positions.
>

I think that there are most likely an infinite number of positions in this
game since either player can fill their own eyes causing occupied points
to again become empty.

Tim