Game-Tree Search Algorithm Based On Realization Probability (2002)
| Venue: | ICGA Journal |
| Citations: | 19 - 1 self |
BibTeX
@ARTICLE{Tsuruoka02game-treesearch,
author = {Yoshimasa Tsuruoka and Daisaku Yokoyama and Takashi Chikayama},
title = {Game-Tree Search Algorithm Based On Realization Probability},
journal = {ICGA Journal},
year = {2002},
volume = {25},
pages = {2002}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In games like chess, the node-expansion strategy significantly affects the performance of a gameplaying program. In this article we propose a new game-tree search algorithm that uses the realization probabilities of nodes for deciding upon the range of the search. The realization probability of a node represents the probability that the moves leading to the node will actually be played. Our algorithm expands nodes as long as the realization probability of a node is greater than the threshold.
