Re: computer-go: Mathematic Go

[Robert Jasiek <jasiek@xxxxxxxxxxxxxxx>]

Compgo123@xxxxxxxxxxxxxxxxx wrote:
> I think there maybe one way to avoid this problem.
> Instead of studying the game positions, one may study the mathematical
> properties of the empty Go board.

Apparently, no one has made studies from that valid direction
so far, although a lot of graph theoretic knowledge is
available. (The exceptions I know of are about the game
complexity.)

Berlekamp et al use a third approach: thick environments during
the middle game. Thereby go moves become just rare choices
among standard choices.

I try a fourth approach: simplified middle game structures, e.g.
by using simplifying rules like the fixed ko rule, which avoids
any kos in practice.

Only one approach won't succeed, so your new approach can broaden
our view.

-- 
robert jasiek
http://www.snafu.de/~jasiek/rules.html