DocumentCode
1873461
Title
CHANCEPROBCUT: Forward pruning in chance nodes
Author
Schadd, Maarten P D ; Winands, Mark H M ; Uiterwijk, Jos W H M
Author_Institution
Dept. of Knowledge Eng., Maastricht Univ., Maastricht, Netherlands
fYear
2009
fDate
7-10 Sept. 2009
Firstpage
178
Lastpage
185
Abstract
This article describes a new, game-independent forward-pruning technique for EXPECTIMAX, called CHANCEPROBCUT. It is the first technique to forward prune in chance nodes. Based on the strong correlation between evaluations obtained from searches at different depths, the technique prunes chance events if the result of the chance node is likely to fall outside the search window. In this article, CHANCEPROBCUT is tested in two games, i.e., Stratego and Dice. Experiments reveal that the technique is able to reduce the search tree significantly without a loss of move quality. Moreover, in both games there is also an increase of playing performance.
Keywords
game theory; tree searching; ChanceProbCut; Dice; EXPECTIMAX; Stratego; chance events; chance node; game-independent forward-pruning technique; search tree; Humans; Knowledge engineering; Minimax techniques; Testing; Trademarks;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Games, 2009. CIG 2009. IEEE Symposium on
Conference_Location
Milano
Print_ISBN
978-1-4244-4814-2
Electronic_ISBN
978-1-4244-4815-9
Type
conf
DOI
10.1109/CIG.2009.5286476
Filename
5286476
Link To Document