Modeling And Research For Computer Game System Based On Moore Automata

The research of computer game began in the 20th century, the 50's. Computer game is a new research field. With the rapid development of computer game, its level of competition is also rising. However,the results of its theory is correspondingly scarce. In order to enable it to achieve a balance of theoretical and practical development, modeling for computer game is urgent.The theoretical research of computer game is mainly divided into two aspects. For one thing, game theory is used to guide the choice of moving method and the equilibrium is dis-cussed in computer game. For another, DEDS (Discrete Event Dynamic System) is used to analyze the hypostasis of computer game. Automaton is not only one of the main tools of DEDS modeling but also the research approach of this paper.Firstly, minimizing of deterministic finite automaton is studied. Minimizing of finite au-tomaton is an important issue.Taking equivalence as precondition, the fewer of the states of automaton the better that we save resources of the software and hardware. The minimizing of the states divides the set of the state into some subsets which are not interactive and ensure that if the states are in different subsets they are distinguishable, else they are undistinguishable and they can be stood for by one element in the subset. State transition inverse function, dis-criminatory state table and a new discriminant theorem are presented by using the equivalence definition of automaton. Based on these, a new method of DFA minimizing is presented. This method is able to make up the deficiency of the old method. And two examples are used to improve the correctness of the method.Secondly, modeling for computer game system is studied.Moore automaton is used through the process of modeling for computer game. Nevertheless, the computer game system is complex, so the construction of Moore automaton is modified by introducing a controlled subautomaton to the model of searching algorithm. Double-stack machine is selected which builds up a feedback loop with supervisor to realize the search method. By the example of the modeling of tic tac toe computer system, the model is verified to be feasible.At last, dots and boxes chess and its several definitions are introduced. Its main strategies are analyzed too. Then the model presented by this paper is applied to 6×6 dots and boxes chess.