Situation assessment and search are two key problems in computer game research. In general, as the game progresses, the difficulty of evaluating the situation of the game is significantly reduced, and the accuracy of the evaluation is significantly increased. Based on the famous chess game, this article proposes and implements a new scheme that combines the Monte Carlo tree search algorithm, the Alpha-Beta algorithm and the model based on the deep convolution neural network (CNN) to solve the computer game problem. This article first proposes a deep convolutional neural network model based on dots and boxes, including deep value network and deep strategy network, focusing on situation assessment and strategy recommendation, respectively. Then, using the Monte Carlo Tree Search (MCTS) algorithm as a framework, deep value network integrated MCTS algorithm and deep strategy network integrated MCTS algorithm are proposed. In both integrated models, Alpha-Beta complete search is used to truncate the Monte Carlo simulation process and improve simulation efficiency. Through competition with human players, the results show that the two integrated algorithm game systems have reached much higher intelligence level than ordinary humans in solving the problem of dots and boxes.
CITATION STYLE
Li, S., Zhang, Y., Ding, M., & Dai, P. (2020). Research on integrated computer game algorithm for dots and boxes. The Journal of Engineering, 2020(13), 601–606. https://doi.org/10.1049/joe.2019.1185
Mendeley helps you to discover research relevant for your work.