This one is a rather brute force approach for a problem we had to solve on a recent job: Finding a path through a bunch of obstacles. Admittedly what we implement here isn’t a very sophisticated algorithm, but its power lies in its simplicity: It will find a path as long as it’s got enough points available.
Also this is another instance where a closest point search comes in quite handy. PCFind, Nearpoints or PCOpen would all be viable options, yet we settled for using PGFind this time, introducing an accelerated version of PCFind.
Have fun VEXing!
Download Project File (.hipnc)