Abstract
Nowadays, the game industry has entered a period of vigorous development, each game artificial intelligence has become the indispensable one element, so a good design can be seen as the soul of game, in almost all games have a kind of be good to hear or see appearance, the soul is attracted to the core game player. In this paper, the genetic algorithm becomes a new random search and optimization algorithm, the basic idea of the theory of evolution based on Darwin and Mendel genetics. Genetic algorithm for solving multi objective and complexity with the unpredictable nature of the problem, there is there is nothing comparable to this superiority. The shortest path problem of network is abstracted to a minimum spanning tree problem and the limitations of the minimum spanning tree are analyzed. The notion of the node degree is introduced.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
