A* Pathfinding Tutorial Series

There are many different pathfinding solutions available; Unity even offers a fantastic built-in pathfinding system. Nonetheless, sometimes it’s simply more fun to code things yourself, even if its only to learn how it all works.

Full playlist: http://www.youtube.com/playlist?list=PLFt_AvWsXl0cq5Umv3pMC9SPnKjfp9eGW

Part one: Introduction the A* search algorithm

2 Likes

Part two: Creating the Node Grid

1 Like

Part three: Programming the A* Algorithm

1 Like

I have really been enjoying your videos. I’m actually about to make a few using a project I did for school. It’s an A* and Parallel Bidirectional A* visualization program. It also has some pretty cool tracing options.

Anyways, I look forward to seeing your MinHeap implementation. It took me way longer than it should have to realize I wasn’t reevaluating my nodes correctly when I made mine.

Thanks Matthew, that sounds very interesting. Here’s part 4 :slight_smile:

Part five

Part six: