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

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




On Sun, 7 Nov 2004, Vincent Diepeveen wrote:

> >Further, if a human does 20 ply fullboard lookahead, this is backed up
> >with a lot of local reading that is not included in the 20 plies. The
> >same will IMO hold true for any strong go program. This reduces the
> >relevance of this "20" even more.
> 
> Forced moves aren't counted in search depth. You get them for free.

What I wrote above has very little to do with forced moves. Most of
the local reading (life and death, connections, etc.) will never be part
of the global lookahead (kills usually don't happen in pro games). They
are needed for evaluation and move selection, "to understand the
position". And the local reading doesn't consist of forced moves either.

I have the same difficulty as Mark with regards to the claimed branching
factor of 10.

Arend


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