Military Chess Game Search Algorithm based on Deep Search

Computer games are divided into complete information games and incomplete information games. Military chess games, as a kind of incomplete information games, have shortcomings in many aspects. In view of the fact that the game tree of the military chess game in the middle and late stages of attacking the banner is too large, this paper proposes an algorithm for deep searching the chessboard according to the military chess rules. In this paper, the bidirectional deep search algorithm is adopted, which reduces the time needed to calculate the approximate optimal solution by nearly 97% compared with using the algorithm of two-way deep search. Compared with the original depth search algorithm, the algorithm in this paper is highly optimized in terms of time complexity. The experiment shows that the search algorithm based on deep search can reduce the operation time of each step and achieve good results.