A* pathfinding on a grid

A classic video game problem is that of pathfinding. Intelligent actors are often required to navigate around obstacles during gameplay. The A* search algorithm (also known as A Star) is commonly used to solve pathfinding by efficiently traversing a constructed node graph.


In this recipe, we will demonstrate grid-based A* pathfinding.

Looking for something?

Use the form below to search the site:

Still not finding what you're looking for? Drop a comment on a post or contact us so we can take care of it!

Visit our friends!

A few highly recommended friends...

Archives

All entries, chronologically...

Weboy