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

[Ray Tayek <rtayek@xxxxxxxxxxxxx>]

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?).


> Given a 19x19 board configuration, flip, rotate and mirror ..
> We only need 362 computers ...
> ...That will speed up the game evaluation almost 360 times.
perhaps, but 360 is small increase. it probably won't make any difference.

> ----- Original Message ----- >1. Represent each point on GO board as 0
> (blank), 1 (white), or 2 (black),
> >thus the board can be expressed as a large number (>=0, and <= 3^360).
>
> yes, there are a few:
>
> dc
> 3 361 ^ p
> 17408965065903192790718823807056436794660272495026354119482811870680
> 10516761846498411627928898871493861209698881632078061375498718135509
> 3129514803369660572893075468180597603
>
> >...
> >The above approach should not require a large programming resources.
>
> size does matter. you are going to wait a *very* long time for your
> computer to do anything this many times.
>
> hth
---
ray tayek http://home.earthlink.net/~rtayek/
orange county java users group http://www.ocjug.org/
want privacy? http://www.freedom.net/
hate spam? http://samspade.org/ssw/