DocumentCode
3565583
Title
The design and implementation of a generic A∗ algorithm for search in multidimensional space
Author
Fridenfalk, Mikael
Author_Institution
Dept. of Game Design, Uppsala Univ., Visby, Sweden
fYear
2014
Firstpage
1
Lastpage
2
Abstract
New technologies enable the realization of game ideas that previously only could be implemented through significant effort. This paper presents the design, implementation and verification of a generic version of the A* pathfinding algorithm, with the capability to navigate in multidimensional space, thereby given a 5D sparse matrix, enabling the creation of 3D worlds in computer games that could be used to facilitate time-travel and travel between parallel universes in a straightforward fashion.
Keywords
computer games; matrix algebra; search problems; 3D worlds; 5D sparse matrix; A* pathfinding algorithm; computer games; game ideas; generic A* algorithm; multidimensional space; search; Algorithm design and analysis; Computers; Context; Games; Programming; Sparse matrices; Three-dimensional displays; A∗; A-star; computer game; game design; generic; multidimensional; multiverse; pathfinding;
fLanguage
English
Publisher
ieee
Conference_Titel
Games Media Entertainment (GEM), 2014 IEEE
Print_ISBN
978-1-4799-7545-7
Type
conf
DOI
10.1109/GEM.2014.7048081
Filename
7048081
Link To Document