Featured Challenge: #51 — A* Pathfinding Algorithm
In this multi-part coding challenge, I attempt an implementation of the A* Pathfinding Algorithm to find the optimal path between two points in a 2D grid.
In this video I explore the wonders of the copy() function in the creative coding platform Processing, simulating slitscan photography and bending time itself! This video is thanks to Tim Rodenbröker’s generous donation to The Processing Foundation!