Path-finding is an important problem for many applications, including network traffic, robot planning, military simulations, and computer games. Typically, a grid is superimposed over a region, and a graph search is used to find the optimal (minimal cost) path. The most common scenario is to use a grid of tiles and to search using A*. This paper discusses the tradeoffs for different grid representations and grid search algorithms. Grid representations discussed are 4-way tiles, 8-way tiles, and hexes. This paper introduces texes as an efficient representation of hexes. The search algorithms used are A* and iterative deepening A* (IDA*). Application-dependent properties dictate which grid representation and search algorithm will yield the best results.
KeywordsComputer Game Grid Search Hexagonal Grid Human Player Tile Path
Unable to display preview. Download preview PDF.
- 1.K. Forbus, J. Mahoney, and K. Dill. How qualitative spatial reasoning can improve strategy game AIs. AAAI Spring Symposium on Artificial Intelligence and Interactive Entertainment, pages 35–40, 2001.Google Scholar
- 3.S. Johnson. Wild Things. Wired, pages 78–83, 2002. March issue.Google Scholar
- 6.J. Laird and M. van Lent. Human-level AI’s killer application: Interactive computer games. In AAAI National Conference, pages 1171–1178, 2000.Google Scholar
- 7.J. Pearl. Heuristics: Intelligent search strategies. In Addison-Wesley, 1984.Google Scholar
- 8.S. Rabin. A* Aesthetic Optimizations. Game Programming Gems. Charles River Media, pages 264–271, 2000.Google Scholar
- 9.B. Stout. Smart moves: Intelligent path-finding. Game Developer Magazine, (October):28–35, 1996.Google Scholar
- 10.D. Takahashi. Games get serious. Red Herring, (87):64–70, 2000. December 18 issue.Google Scholar
- 11.P. Yap. New Ideas in Pathfinding. PhD thesis, Department of Computing Science, University of Alberta. In preparation.Google Scholar