Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Well, I’m trying to implement A* Pathfinding into a simple tilemap array and I have a few questions.
For the open/closed list should I just use an arrayList to store all of the points it finds or is there a better method for storing them?
Second how do I go about checking neighbours? Do I take the start tile, check the one above,below,left and right and whichever has the lowest cost is stored?
As long as you aren’t implementing this for a game, meaning high-fps video game, I doubt your performance will take a significant hit for using as ArrayList, that should be fine.
As to the second part of your question assuming you only have 4 directions of connectivity for each node then yes, a simple sequential check of each neighbor will work.