Titlebook: Computers and Games; 4th International Co H. Jaap Herik,Yngvi Bj?rnsson,Nathan S. Netanyahu Conference proceedings 2006 Springer-Verlag Ber

實現(xiàn)

Chauvinistic

CURT

,Associating Shallow and Selective Global Tree Search with Monte Carlo for 9 × 9 Go,o experimental Monte-Carlo programs. We provide a min-max algorithm that iteratively deepens the tree until one move at the root is proved to be superior to the other ones. At each iteration, random games are started at leaf nodes to compute mean values. The progressive pruning rule and the min-max

Eosinophils

LEVY