>You're mixing the two pondering strategy. In this strategy, you always >have a match, so you really get 1 + 1/BF.
Ah, a common misunderstanding of alpha-beta. Alpha-beta search only produces *moves* along the principal continuation. In other variations you only get *upper bounds*. So you have to match the opponent's move to get a predicted move. >How is the former explanation different from go, or invalidating my >argument ? UCT search gives you a best move at every node. Brian _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
