Pathfinding Implementing A* in a 2D Virtual Environment

This paper shows the progress of a thesis project in progress, which consists of the search for an optimal route in a virtual environment, case study extended maze, by implementing the A Star algorithm, which uses two lists that control the exploration sequence in the extended maze and a heuristic measure that makes it a fast and optimal method. The tests are performed using input/output streams with text files whose data are treated internally in the application as binary matrices on which A* operates on the 8 neighbors of each cell.