Skip to content
Hallway
0:00 / 0:00

#a*search#pathfinding#unity

A* Pathfinding (E01: algorithm explanation)

Sebastian Lague

1.4M subscribers • 11 videos on Hallway

YouTube
  • Recommended by 2 people: 1 in engineering communities and 1 curated list.
  • Presented by Sebastian Lague
  • Linked in the descriptionSebLague/Pathfinding
  • May be out of date. Uploaded 11 years ago, in an area where tools change fast.

Beginner. No background in the topic needed.

2.2M views11 years ago2 recommendations

Computer scienceGame developmentAlgorithmsGame programming

Sebastian Lague explains the mechanics of the A* pathfinding algorithm and how it calculates optimal paths using heuristics.

Welcome to the first part in a series teaching pathfinding for video games. In this episode we take a look at the A* algorithm and how it works. Some great A* learning resources: theory.stanford.edu/~amitp/GameProgramming/ policyalmanac.org/games/aStarTutorial.htm Source code: github.com/SebLague/Pathfinding If you'd like to support the creation of more programming videos, I'd greatly appreciate your support on patreon: patreon.com/SebastianLague Background music is 32. The Hidden Path by longzijun.

Why it's here

2 people recommend this

What people say. Recommended as an exceptionally clear visual explanation of the A* pathfinding algorithm.

Coding Interview Universitycurated list on GitHubRecommends

Under “Additional Learning”

A* Pathfinding (E01: algorithm explanation) (video)
View the list

u/ngfwangin r/compsci • Recommends

On “There's no way ASTAR is better than Greedy BFS, I have tested it out.”

…he point of A\* search is that it guarantees to find the optimal path, given that the heuristic is **admissible** (it never overestimates the actual cost to the goal). By doing so it keeps track of many information, like the node explored, their cost. Thus it is costly (compared with GBFS). I found this a great video for understanding A\* search: [video Whereas GBFS, as name suggest, greedy. It is essentially DFS but using heuristics to choose the next neighbor to explore. It guarantees to find **A** solution (if exists), but it is not necessarily the best solution. But given the heuristic is good, the path wont be far off from the true optimal.…
1View on Reddit

u/Fun-Setting-3905in r/C_Programming • Mentions

On “Interresting projects for a beginner.”

write a program to visualize algorithms, they can be Pathfinding algorithms Computational Geometry Algorithms etc... making something visual and interactive may be more attractive to an employer
1View on Reddit