[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [computer-go] Modern brute force search in go



At 13:51 7-11-2004 -0500, Don Dailey wrote:
>
>>    The "danger" that you must work again on Cilkchess seems to be rather
low.
>>    As far as I know has interest for computerchess in the US vanished.
It is
>>    generally quite difficult to find a sponsor for a computerchess
event. This
>>    is somewhat ironic. The big goal was to surpass humans. The programs
are now
>>    at least close to this goal, but nobody is interested anymore. People
found
>>    computer-chess only interesting, when the could understand the errors
of the
>>    programs.
>>    Go has in this sense a bright future, but in Europe and probably U.S.
it is
>>    an almost unknown game.
>
>And that is a shame.    I strongly feel that even when humans are clearly
>surpassed,  we are just getting started.  Chess is an incredibly deep game
>and the very best humans are very weak compared to the "ultimate player."
>
>Just my thoughts.  All of this  is even more true of Go.  There exists
>(in  principle) a  future GO  player than  can make  the very  best Go
>player (of today or yesterday) look like a baby.
>
>- Don

In chess there was soon an indication what the average 'non forced' search
depth is of combinations played at GM level. That was already estimated to
be around 12 ply some tens of years ago.

It is very interesting to see that this is a very true number.

For go programs it will be very interesting to know what the tactical
barrier depth in go is.

As i'm a layman there perhaps others can put a light on this?

That depth is very important for conclusions with respect to what strength
software can have when compared to human playing strength.

If the barrier depth is far above what professional players see now, it
will be trivial that programs will get a lot stronger than mankind.

Additionally we can also calculate the cpu power required, knowing that the
branching factor in GO starts at empty board at around 10.0 (using
nullmove) and slowly climbs down. Hardware gets 2 times faster each 2 years
(no longer each 18 months), so it's easy to do math with that.

Vincent

_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/