The maximin search algorithm in game trees
Game playing theory is an important research branch of artificial intelligence.In this paper,we first describe how to build a game tree for five-piece chess game.Then,we introduce a maximin search algorithm in game tree to find the optimal playing strategy,and α — β pruning strategy to improve the search efficiency.Finally,we evaluate the performance of search algorithm by analysis and an example program based on Visual C++ 6.0.
game tree minimax serach α— β pruning evaluation function
Chen Miao Tan Shunhua Yang Guohai
School of Information Engineering,Southwest University of Science and Technology Mianyang,Sichuan,China
国际会议
太原
英文
608-611
2011-02-26（万方平台首次上网日期，不代表论文的发表时间）