[computer-go] Explanation to MoGo paper wanted.

Benjamin Teuber benjamin.teuber at web.de
Thu Jul 5 06:42:43 PDT 2007


But you can improve the prior probabilities of your search function by 
remembering shapes (hopefully more abstract ones in the future, 
including more knowledge about the neighbourhood) that seemed like good 
moves before, so I don't share your opinion.
Whether or not this knowledge shout also be strongly employed deeper in 
the search tree (corresponding to the "playout" part) is another 
question to me.

Benjamin
> I think trying to learn from human games is usually bad too, for similar
> reasons.  I had at least 3 reasons why I think it's bad, one of them is
> simple what I call the omission problem,  you don't really see (or
> sample) the reasons certain moves are or are not played.   
>
>
> - Don
>   



More information about the computer-go mailing list