Title :
Bigram Realization Probability for Game Tree Search
Author :
Kimura, Takeshi ; Ugajin, Takuya ; Kotani, Yoshiyuki
Author_Institution :
Dept. of Electron. & Inf. Eng., Tokyo Univ. of Agric. & Technol., Koganei, Japan
Abstract :
In chess-like games in particular Shogi (Japanese Chess), Realization Probability[1](RP) is an indispensable tool for calculating move ordering and game tree search expansions/reductions. In this paper, we propose a brand new way of calculating Big ram Realization Probability (BRP) based on Tsuruoka´s Realization Probability and show the efficiency of move ordering and node expansions/reductions. It is a kind of Realization Probability that whole features are based on the information of a current move and its previous move. In our experimental results, a Shogi playing program implementation by BRP wins 62 -- 38 with the program based on original Realization Probability.
Keywords :
game theory; trees (mathematics); BRP; Japanese Chess; Shogi; Tsuruoka realization probability; bigram realization probability; chess like games; game tree search; Arrays; Calculators; Educational institutions; Games; Probability; Smoothing methods; Realization Probability; bigram; negamax;
Conference_Titel :
Technologies and Applications of Artificial Intelligence (TAAI), 2011 International Conference on
Conference_Location :
Chung-Li
Print_ISBN :
978-1-4577-2174-8
DOI :
10.1109/TAAI.2011.53
