Hey guys. I have made a tutorial on A* Pathfinding. I made a video on how to go about it. Its the simplest pathfinding but you can always make it smarter and better. I always noticed there isnt video tutorials showing how to do it from scratch and if there is then its lacking. My username on YouTube is iGunSlingeRv2 but Ill be putting the videos here. If you are interested check them out. Enjoy!
This is the first Tutorial and here I will be creating a struct that will contain our information of SearchCells that will be used for our pathfinding. I will mentioning the heuristic, accumulated distance and the manhattan distance. We will also be creating our PathFinding class. In here will be the information that will be included on our header file.
This is the third tutorial and here ill explain what to do when the path is opened. So basically if the cell is blocked or not.
This is the last tutorial and ill be talking about what to do if the path is opened which will continue our path. We will be checking our left, right, up, down, diagonal nodes. I will also explaining how to get the first position of the cell for the enemy or Ai to follow.
In this video I will show you the Pathfinding in ACTION!
Alright guys well hope you enjoy it. If you have any question comment here or just send me a message on Youtube with the username i mentioned on top. Check out my other tutorials there as well. :)
