期刊名称：Journal of Emerging Trends in Computing and Information Sciences
电子版ISSN：2079-8407
出版年度：2012
卷号：3
期号：4
页码：596-599
出版社：ARPN Publishers
摘要：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 a-ß 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; evaluation function
