Application of UCT-RAVE algorithm in multi-player games with imperfect information
Yili Wang · Jisuanji gongcheng yu sheji · 2012
Aimed at the problems that traditional gaming search algorithms do not suit to multi-palyer games with imperfect information,a method of combining UCT-RAVE and Monte-Carlo sampling is proposed,after analyszing the principle and characteristic of UCT-RAVE algorithm.First,the imperfect information is replaced by simulating perfect information with Monte-Carlo sampling,then UCT-RAVE is used based on perfect information for searching,at last most suitable action is selected after considering the best profits of many Monte-Carlo samples.Simulation demonstrated the feasibility and the effectiveness of the method.