[computer-go] The global search myth

[Forrest Curo]

> Relatively speaking chess eval of adding piece values together and
> doing nothing else is far closer to optimal evaluation function that
> what is currently available in Go.

A GOOD go evaluation function probably needs to incorporate lookahead...

Through most of the game, the difference between "a dead group" and "a  
live group" can only be distinguished by answering "What happens here  
if I do THIS?"

And to make that investigation supportable, you need a good  
move-evaluator. A pattern-recognizer with a taste for 'good shape.'

In other words, all these functions are interdependent and virtually  
need one another just to "define" (in an operational sense) what they  
need to consider!

Forrest Curo



----------------------------------------------------------------
This message was sent using IMP, the Internet Messaging Program.