I agree. The effective branching factor is similar for go and chess. Go has a higher raw branching factor, but it is much easier to prune bad moves with some simple rules and patterns For example, Many Faces never considers more than 30 moves at any position, including the root, and is quite strong. I doubt there is a strong chess program that only looks at 15% of the legal moves.
David Fotland > > What matters is how much you can prune it with a reasonable degree of > confidence, and my experience so far seems to indicate the real difference > here isn't that big. It seems to be much easier to statically determine > which moves are good and bad in go than in chess. (The opposite of the > positional evaluation!) > > At least in my case, my Go program searches deeper for the same amount of > nodes compared to my chess program. What's more: this isn't actually > dependent on the size of the board! > > I do not believe that the branching factor of Go is actually that much of an > issue for the tree search. > > > -- > GCP > _______________________________________________ > Computer-go mailing list > [email protected] > http://dvandva.org/cgi-bin/mailman/listinfo/computer-go _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
