Re: computer-go: Applying Moore's Law to Computer Go

[Ray Tayek <rtayek@xxxxxxxxxx>]

At 10:18 PM 11/16/99 +0900, you wrote:
> I disagree.
>
> It was predictable that the strength of chess playing programs would
> increase ... because by the mid-1980s we
> had solved the basic problems ...
>
> In the case of go, nobody has come up with the idea yet of how to write a
> strong playing program.
well, gee, if i could just figure out which sets of rules to apply here:
for example (assume beginning of game).
        1. this area is still the biggest/most important
        2. i don't have a live shape, so make one
        3. my opponent has lots of stones on the fourth line
        4. try to answer on the fourth line.

>  We do not even have the basic algorithms yet, so
> how can we make them work better or more efficiently?
>
> Until somebody finally comes up with THE BIG IDEA, I do not believe there
> will be any significant improvement in the strength of go playing programs.
i don't think it will be a big idea, i think it will be a bunch of rules 
like the above (maybe a few hundred) that get weighed depending on pom.

but some of you must be doing things like this in your programs?
Ray (will hack java for food) http://home.pacbell.net/rtayek/
hate spam? http://www.blighty.com/products/spade/