I have a question regarding seemingly relatively simple collision detection and pathfinding. Thus far I’ve been doing pathfinding using the A* algorithm and nodes, but I want to do something simpler for a current project.
Simply put, I just want a character to traverse directly from point A to point B, and pillar-hump around any obstacles he encounters. Of course, if the unfortunate character walks into a concave area, he would never be able to get out… that’s fine. Here’s an illustration of the initial setup, what A* will do, and what I actually want to do:
I was wondering if anyone here has ever done this, and if so, could suggest the best way to go about doing it?
Thanks for any suggestions folks!