A Multi-modal Searching Algorithm in Computer Go Based on Test

摘要：

　　Pattern matching algorithms based on domain knowledge have a weak global sense.Monte Carlo algorithms have a weak tactical ability.This article proposed a multi-modal algorithm on the basis of tests.GNU Go software was used to make experiments.Through the analysis of the experiment data,we set the move thresholds of start,middle,and the end of a Go play game.In the start stage,pattern matching algorithm was used.In the middle stage,Monte Carlo tree search algorithm with pruning was used to search the optimal moves.In the end stage,pattern matching and crazy model were used.The multi-modal algorithm was applied to develop software.Experiments demonstrate that multi-modal algorithm can improve the performance of Go in 13×13 board and 19×19 board.

关键词： Go Pattern matching Monte Carlo Pruning Domain knowledge Multi-modal

作者: Xiali Li Licheng Wu

作者单位: School of Information Engineering,Minzu University of China,Beijing 100081,China

会议类型: 国际会议

会议名称: The 2015 Chinese Intelligent Automation Conference(2015中国智能自动化会议)

会议地点: 福州

会议语种:英文

页码: 143-149

在线出版日期: 2015-05-08（万方平台首次上网日期，不代表论文的发表时间）