My version of the A star pathing algorithm using c++ and the TL-Engine. This was done for a second year assignment at UClan.
Green: Nodes Visited.
Red: Node Found.
Sphere: Current Node.
Cube: End Goal
The red line represents the shortest distance from the start to the end using a Bezier curve.
Best viewed in full-screen. Use YouTube’s playback function to slow down the video if needed.
Note: The ball’s jumpy movement is caused by my slow computer. The movement is calculated using frame time and on slow machines can sometimes cause over corrections which is what causes the ball to wiggle like that.