Click here to Skip to main content
15,867,967 members
Please Sign up or sign in to vote.
0.00/5 (No votes)
See more:
I am doing a project to code the A* algorithm in the shortest path problem. In able to determine the shortest path using A* algorithm, I acknowledge that we have to get the heuristic value first. Do anyone know how to calculate and determine the heuristic value for each nodes? [i made up the map on my own so no heuristic values given]

What I have tried:

So far, i do not have any idea how to start.
Posted
Updated 25-Nov-17 0:45am
Comments
Richard MacCutchan 25-Nov-17 6:44am    
This is a mathematical problem, so your best course would be to study the algorithm and write out the necessary paths to solve it. You can then turn that into code.

1 solution

 
Share this answer
 

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900