Explore the fundamentals of the A* search algorithm in this 24-minute game programming video. Dive into the concepts of f-cost, g-cost, and h-cost, and understand their roles in pathfinding. Learn about nodes and their significance in graph traversal. Gain insights into how the A* algorithm efficiently finds optimal paths in game development. Discover practical applications of these concepts in creating intelligent navigation systems for game characters and NPCs.
Overview
Syllabus
Intro
Nodes
Parent
Cost
J Cost
Outro
Taught by
The Cherno
