[Computer-go] 19x19 opening books
andresdju at gmail.com
Thu Jul 14 13:24:50 PDT 2011
IMHO can be two types of weak solving Go:
1- Prove black or white can allways win despite the moves
of the other player with a given komi from a given position
(for example empty board).
2- Play best moves (get the most points) despite the moves
of the other player from a given position.
2 implies 1 for every komi, 1 only works with a given komi. The
first one also doesn't proves komi for perfect play draw.
I'm also not an expert, so maybe I'm wrong.
More information about the Computer-go