文章基本信息

标题：Research on Different Heuristics for Minimax Algorithm Insight from Connect-4 Game
本地全文：下载
作者：Xiyu Kang ; Yiqi Wang ; Yanrui Hu 等
期刊名称：Journal of Intelligent Learning Systems and Applications
印刷版ISSN：2150-8402
电子版ISSN：2150-8410
出版年度：2019
卷号：11
期号：02
页码：15-31
DOI：10.4236/jilsa.2019.112002
出版社：Scientific Research Publishing
摘要：Minimax algorithm and machine learning technologies have been studied for decades to reach an ideal optimization in game areas such as chess and backgammon. In these fields, several generations try to optimize the code for pruning and effectiveness of evaluation function. Thus, there are well-armed algorithms to deal with various sophisticated situations in gaming occasion. However, as a traditional zero-sum game, Connect-4 receives less attention compared with the other members of its zero-sum family using traditional minimax algorithm. In recent years, new generation of heuristics is created to address this problem based on research conclusions, expertise and gaming experiences. However, this paper mainly introduced a self-developed heuristics supported by well-demonstrate d result from researches and our own experiences which fighting against the available version of Connect-4 system online. While most previous works focused on winning algorithms and knowledge based approaches, we complement these works with analysis of heuristics. We have conducted three experiments on the relationship among functionality, depth of searching and number of features and doing contrastive test with sample online. Different from the sample based on summarized experience and generalized features, our heuristics have a basic concentration on detailed connection between pieces on board. By analysing the winning percentages when our version fights against the online sample with different searching depths, we find that our heuristics with minimax algorithm is perfect on the early stages of the zero-sum game playing. Because some nodes in the game tree have no influence on the final decision of min i max algorithm, we use alpha-beta pruning to decrease the number of meaningless node which greatly increase s the minimax efficiency. During the contrastive experiment with the online sample, this paper also verifies basic characters of the minimax algorithm including depths and quantity of features. According to the experiment, these two characters can both effect the decision for each step and none of them can be absolutely in charge. Besides, we also explore some potential future issues in Connect-4 game optimization such as precise adjustment on heuristic values and inefficiency pruning on the search tree.
关键词：Heuristics;Minimax Algorithm;Zero-Sum Game;Connect-4 Game