Re: [computer-go] Search = Bad!

[Don Dailey <drd@xxxxxxx>]

Hi Mark,

Is the distinction you are making about global search versus local search?


- Don




>  Maybe it makes sense to make a distinction between search and lookahead? 
>  I think a Go playing program can do without search, but not without 
>  lookahead. The difference between the two is that lookahead establishes 
>  a goal (the open spot in the forest) and tries to find the fastest way 
>  to get there. Search just tries to move randomly and see if it got 
>  closer to its goal. Search works for chess because the pieces act as 
>  landmarks and make it easy to see if you get closer to your goal. In Go, 
>  stones are like trees in a forest, they all look alike in any direction 
>  you move. (Although I don't want to take this analogy too seriously ;-))

>  What perplexes me though is Frank's sudden change of mind. Not so long 
>  ago patterns with search was the holy grail to solving Go. Although it 
>  never hurts to look at things from a different perspective once in a 
>  while of course.


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