Vibe Coding Encyclopedia

A* pathfinding with open and closed sets

The open (yellow) and the closed column (the green) are seen one step at a time, and A* · daixtra · greed search is a side-by-side comparison of the way to find its way.

Category
Pathfinding & movement

Technical terms · A* pathfinding (f = g + h) · Dijkstra's algorithm · Greedy best-first search · Octile distance heuristic · binary heap

Related techniques

Technique document (Korean)