The Application Analysis and Optimization of A* Algorithm in the Game Map Routing


This article first analyses the reason that A* algorithm influences speed when searching for optimum route in game map, then it gives the optimization scheme from the aspects of node structure, the maintenance of open queue and so on. What is more, it carries out theoretical analysis for the improvable A* algorithm. At the same time, the scheme is tested and evaluated by a lot of different big and small maps. Experiment result shows the improvable A* has very actual value in seeking the solution of way problem for map. And it has certain reference meaning in instant strategic kinds of game.

  • Abstract
  • Key Words
  • 1. Introduction
  • 2. A* Algorithm Analysis and Optimization
  • 3. The Testing of Improvable A* Algorithm
  • 4. Conclusions
  • References

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In