Breaking News: Grepper is joining You.com. Read the official announcement!

how does the a* algorithm work

rawbone_3000 answered on January 18, 2022 Popularity 10/10 Helpfulness 2/10

answer how does the a* algorithm work

how does the a* algorithm work

Comment

make an openlist containing only the starting node
   make an empty closed list
   while (the destination node has not been reached):
       consider the node with the lowest f score in the open list
       if (this node is our destination node) :
           we are finished 
       if not:
           put the current node in the closed list and look at all of its neighbors
           for (each neighbor of the current node):
               if (neighbor has lower g value than current and is in the closed list) :
                   replace the neighbor with the new, lower, g value 
                   current node is now the neighbor's parent            
               else if (current g value is lower and this neighbor is in the open list ) :
                   replace the neighbor with the new, lower, g value 
                   change the neighbor's parent to our current node

               else if this neighbor is not in both lists:
                   add it to the open list and set its g

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: brilliant.org

Tags: algorithm whatever

Link to this answer
Share Copy Link

Contributed on Jan 18 2022

rawbone_3000

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

how does the a* algorithm work

Contents

More Related Answers

how does the a* algorithm work

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.