[COLOR=“RoyalBlue”]EDIT: This thread has been solved. Check my final solution product (as a result) here!
Thanks! [/COLOR]
Honesty. I’m about to kill myself.
I’ve been trying to work on pathfinding for the last month and in the many attempts, I just can’t seem to get it working although I’ve come close. I’ve looked online, and have read the famous article and … I get it!
I understand how A* Pathfinding works; calculating F=G+H is no problem for me, and storing them in the openList, finding the lowest fCost and storing it into the closed list is not an issue (I don’t think).
I just … need someone to walk me through this from scratch. I think I’ve been going about it with my own perspective and (bad) understanding of pathfinding that I just can’t think outside the box. I don’t know what else to do anymore and I’m getting really discouraged, yet determined to get a very simple (that’s all I need!) working pathfinding engine going.
So … someone … please help me out and help me figure this out. Or at least a hug. I need a hug.
