The design and implementation of a generic A∗ algorithm for search in multidimensional space

摘要

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.