A* Search
Let h be the h value of the start node. What are the g and f values for the start node?
What value is the frontier ordered by?
In this implementation of the algorithm, can there be multiple f values for the same node in the frontier?
Which statement is true about A* search and Uniform Cost Search (UCS)?
Let's say that node n is in the frontier with value v. Is v guaranteed to be the shortest path from the start node to n?
Let the heuristic h(n) be the straight line distance between node n and the goal node. Which of the following is/are true?