The problem with this is that below a few ply, the probabilities are all effectively zero. All you're really doing is enshrining the prior probabilities used to sort the first few levels.
In cases where the good moves are the "obvious" ones, you've found them anyway. In other cases, you prune them away. You DO get wrong answers much faster this way though. _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
