A* Pathfinding Algorithm

Sep 5, 2022 min read

Project Overview

Platform: PC (Unity)
Technologies Used: Unity, C#, A* Pathfinding, Algorithms
Duration: 1 months

Description

Implemented my own A* pathfinding algorithm in C#(Unity). Basically A* algorithm will find the shortest distance to destination taking obstacles into account. My mouse click on top right side of the screen sets destination.I am ideating to create a game out of this.

Key Features

  • The algorithm calculates the shortest path on a grid, and the result is visualized by drawing the grid, the open and closed nodes, and the final path on the screen.
  • Obstacles can be placed within the grid to simulate real-world obstructions. The A* algorithm dynamically adjusts the path to avoid these obstacles while calculating the shortest route.

What I Learned

  • Gained an in-depth understanding of how the A pathfinding algorithm* works, especially in the context of visualizing each step in the process.
  • Developed the ability to break down complex algorithms into visual feedback, making them easier to understand and follow.