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.
I was thinking about building a tower defence game and was trying to find the best way
to find the shortest path to the other side.
How can i do this?
I know I need to re evaluate the path on every move due to people adding more towers.
I am thinking I need to use visualtreehelper to find what is in the way.
This might be better asked at https://gamedev.stackexchange.com/
You don’t need to re-calculate the path all the time, only when a tower is created or destroyed.
The A* algorithm would be commonly used, there are many samples around. Making your game tile-based would simplify its use, as each tile would be a node, and it’s trivial to work out the connections (i.e. up/down/left/right, providing the node isn’t blocked).