A sequential synchronous sequential Monte Carlo search algorithm

Abstract

A sequential synchronous sequential Monte Carlo search algorithm is provided. The search algorithm is adapted to a search system. The searching system comprises a searching server, a searching entry and a searching device. The searching algorithm comprises the following steps: designing a game tree structure, changing the meaning of the information stored in the node and the connecting edge of thestandard Monte Carlo game tree, and compressing the multi-layer nodes on the standard Monte Carlo game tree containing the information of the game parties to the same layer; and dividing the nodes ineach layer of the new game tree into fixed time periods. In the aspect of problem model, the search algorithm realizes the good modeling of sequential synchronization decision-making problem. In theaspect of searching process, the search algorithm makes the searching more close to the synchronization characteristic of the sequential synchronization decision-making game problem.

Description

technical field [0001] The invention relates to the field of machine game search, in particular to a Monte Carlo tree search algorithm. Background technique [0002] Monte Carlo method, also known as statistical simulation method and random sampling technique, is a very important and widely used numerical calculation method based on "random numbers" and probability statistics theory. In the 1970s, the theoretical research of the Monte Carlo method reached its peak. From the very beginning of nuclear research to the present, the development of theory and practice in the United States is ahead of other countries and is at a relatively high level in the world. With the development of information technology , other countries have also started Monte Carlo research procedures. In recent years, many units and universities at home and abroad have used Monte Carlo programs in large quantities, started the research on Monte Carlo methods, and vigorously promoted the development of do...

AI Technical Summary

Problems solved by technology

However, many simulation problems belong to static game problems, that is, both sides of the game make decisions at the same time, and the general Monte Carlo method searches based on the alternate decisions of the two sides of the game, so some necessary improvements need to be made on the basis of the standard Monte Carlo tree search , to adapt to the simulation problem where both parties make simultaneous decisions

Images