These algorithms try to find a path along the grid. There are many
path-finding algorithms that are commonly known and used, but
which would be the best to use is usually problem specific. While some work to find the path with lowest total cost (or distance),
some algorithms do not rely on any cost information of the path in
its expanding process. Hence, the aim is to explore path-finding, a
seemingly common yet challenging problem, in a 3D game world.
Actual implementation of the stated problem will be carried out, to
learn about the underlying difficulties in solving the problem, and
also to uncover the resulting effects