在3D游戏环境中，使用具有2D图层的A *算法执行寻迹或图形遍历。 然而，在3D虚拟环境或空间中，使用2D层的A *算法是有限的。 因此，有必要使用在3D游戏环境中使用3D图层的算法。 这项研究表明，3D A *算法可以比在3D游戏环境中使用2D图像的A *算法更快地配置两个节点之间的路径。(In a 3D game environment, pathfinding or graph traversal is performed using the A* algorithm with 2D
layers. However, in a 3D virtual environment or space, A* Algorithm that uses 2D layers is limited. Therefore, it
is necessary to use an algorithm that uses 3D layers in a 3D game environment. This study shows that a 3D A*
Algorithm may configure the path between two nodes faster than an A* Algorithm that uses 2D layers in a 3D
game environment.)