What’s more, as people keep reinforcing search algorithms and machine learning technologies in AI, it has developed superhuman intelligence. Minimax algorithm has already achieved significant success in area of game including chess, backgammon and Connect-4. 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. According to the experiment, these two characters can both effect the decision forĮach step and none of them can be absolutely in charge. During the contrastive experiment with the online sample, this paper also verifies basic characters of the minimax algorithm including depths and quantity of features. 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. 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. Different from the sample based on summarized experience and generalized features, our heuristics have a basic concentration on detailed connection between pieces on board. We have conducted three experiments on the relationship among functionality, depth of searching and number of features and doing contrastive test with sample online. While most previous works focused on winning algorithms and knowledge based approaches, we complement these works with analysis of heuristics.
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. In recent years, new generation of heuristics is created to address this problem based on research conclusions, expertise and gaming experiences. 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. Thus, there are well-armed algorithms to deal with various sophisticated situations in gaming occasion.
#MINIMAX ALGO TO PLAY HALMA GAME CODE#
In these fields, several generations try to optimize the code for pruning and effectiveness of evaluation function. Minimax algorithm and machine learning technologies have been studied for decades to reach an ideal optimization in game areas such as chess and backgammon.
0 kommentar(er)
