GAME-TREE SEARCH ALGORITHM BASED ON REALIZATION PROBABILITY
Yoshimasa Tsuruoka, Daisaku Yokoyama, Takashi Chikayama · ICGA Journal · 2002
In games like chess, the node-expansion strategy significantly affects the performance of a game-playing program. In this article we propose a new game-tree search algorithm that uses the realization probabilities of nodes for deciding upon the range