[computer-go] Lazy Evaluation in Monte Carlo/Alpha Beta Search for Viking4

Rémi Coulom Remi.Coulom at univ-lille3.fr
Sun Jul 23 09:10:45 PDT 2006


Rémi Coulom wrote:
> with the highest upper bound (which should also be the move with the 
> highest lower bound if intervals are symmetrical).

oops, sorry, this is wrong.

Highest upper bound to prove the node is below alpha, highest lower 
bound to prove it is above beta.

Rémi


More information about the computer-go mailing list