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

["Ran Xiao" <ranxiao@xxxxxxxxxxxx>]

Ray,

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. Since String itself can be compared as who has the
larger or smaller value as in dictionary order, such as if E, B, and W are
used to represent a position as Empty, Black, and White, calculating the
large number is even not necessary.

Given a 19x19 board configuration, flip, rotate and mirror it to get 16
possible symmetric configurations; then express these board configurations
as Strings, find the one has the smallest value and treat this one as the
board configuration. This operation does not take any noticeable CPU time.

We only need 362 computers, in which 361 computers deal with one board
position's learning and evaluation, and the remained one computer does every
thing else. That will speed up the game evaluation almost 360 times.

Weimin Xiao

----- 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