Research Of The Computer Games System Modeling And Searching Algorithm Based On Finite Automata

A long term goal of computer games is to make computer play board and card games, particularly to challenge the super master players. In order to fasten the development of the new research domain with breakthrough results and drosophila effects in artificial intelligence, the modeling and searching algorithm need to be studied well. Game tree searching is a significant aspect for computer game. In the world, there are many algorithms to improve the effect of game tree searching, but in China the mostly used algorithm is also max-mini algorithm. To improve the effect of max-mini algorithm, there are some methods to modify the algorithm with different thoughts. As the foundation of computer, the finite automata a math model of discrete event dynamic systems which could be used for modeling the behavior of objects.The computer game system models of finite automata and search algorithms are studied in this paper, and the main idea of which as follows. Firstly, the application of finite automata in computer games is summarized. The model and the main measure of discrete event dynamic systems are analyzed. So the conclusion that modeling of finite automata for computer games systems includes discrete event dynamic systems is obtained. And the six-tuple of finite automata is proposed. Then the example of vending machine modeling is illustrated. However, the finite automata is used for modeling the decision behavior of people in game. In the model a finite automata of each people within game is chosen to play games with the finite automata belong to the completers. Based on the information obtained we go to next step and the new periodicity is started. In the modeling for computer games of finite automata, two finite automatas are made up a closed-loop system. From this the seven-tuple of finite automata is proposed and chess game of cattle horn is used to verify the theory. Secondly, with the analysis, the game tree search technique is important for the heuristic role. At present some new algorithms are proposed which are different from the classical algorithm in the form. But in fact the essence is in the same. Based on the recognition role of finite automata in this paper, the example of recognition role in finite automata for numerical computing is used for the interpretation. The convenience of regular expression in algebra computing and the application of finite automata in matching are analyzed. So the finite automata is transformed into regular expression by regular grammar. The language of finite automata could be used regular expression. In the end, the example of chess game of cattle horn is used to verify the measure.