Re: computer-go: Data Mining and Rulebase for GO

["Ran Xiao" <ranxiao@xxxxxxxxxxxx>]

Ray,

I am pretty sure there are 8 symmetries. But I do remember some one
suggested 16 symmetries. All are before replacing White move as Black - what
I called Forever Black algorithm.

Weimin

P.S. I am fighting to get my compute 4 times faster. 360 times faster is not
a small number. It may take Intel 16 years to do it.

----- Original Message -----
From: "Ray Tayek" <rtayek@xxxxxxxxxxxxxxxxx>
To: <computer-go@xxxxxxxxxxxxxxxxx>
Sent: Sunday, November 12, 2000 3:30 PM
Subject: Re: computer-go: Data Mining and Rulebase for GO


At 11:17 PM 11/11/2000 -0800, you wrote:
>...
>The purpose of finding the smallest large number for a board configuration
>is to set a standard board representation, so symmetric board configuration
>will not be stored....

sure, you might be able to go one step further and collapse an equivalent
board position with black replacing white (maybe that is where you got 16
from?).

...
perhaps, but 360 is small increase. it probably won't make any difference.

>
>hth
>
>