> > Lazarus had that problem too and before that my simple bot had it really > badly because it did not have the benefit of a tree search. I don't > know if discounting the move is a reasonable solution or not, perhaps it > is. But I think that if you can solve it in the playouts you solve it in > general. You almost need to determine in the playout how to refute a > stupid ko threat but I don't think that is simple at all. > > Don > > Solving it in the playouts would be great, but that puts all the load on move generator. I'm thinking about how to improve the tree, given that the move generator can't be perfect. The damage is also much larger in the tree. Worst of all is the top level of course. :-) But the whole tree could benefit by being littered up less by ko threat permutations.
Maybe something like the killer heuristic in chess could help weed out ko threats, by remembering the refutations. Has a context sensitive RAVE been tried? Something like remembering where in the 5 by 5 vicinity the last opponents move was played. Stefan > > >
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
