Random placement algorithm of Military game based on Fisher-Yates

Computer game
^[1]
is a research field, an important research direction in the field of artificial intelligence, and an important scientific research foundation in the field of machine intelligence, wargame deduction, intelligent decision system and other artificial intelligence. Machine game is considered to be one of the most challenging research directions in the field of artificial intelligence. As a member of computer game, military game is a game with incomplete and asymmetric information. One of the important links is that both sides need to play according to their own wishes in advance. It can be said that in the computer Military game, the layout affects the outcome of the whole game to a certain extent. In order to solve the problem of layout choice in practice, this paper proposes a random layout algorithm based on Fisher Yates shuffle algorithm, which can be used to generate absolutely random military chess layout, test the existing layout and program strength, and find the most suitable layout for the determined combat strategy and style. Compared with the previous method of generating a large amount of test data randomly, it can solve the problem. The new algorithm optimizes the original 25! times to 50 times, and optimizes the algorithm from O (n
²
) of Fisher algorithm to O(n), so researchers can have more energy to find the best way for different strategies, which objectively strengthens the combat capability of the program. And it weakens the influence of human factors in the test and reduces the dependence on human intelligence in computer game.